Paper Info
Title
Edge-disjoint maximal planar graphs
Abstract
We show that if n ⩾ 6 m then it is possible to construct m edge-disjoint maximal planar graphs on a set of n vertices, but that it is not possible if n < 6 m − 1. We also show that given a pair of edge-disjoint maximal planar graphs, and a specified face in one, there exist at least three faces in the other which are vertex-disjoint from the specified face. For three edge-disjoint maximal planar graphs there exist three faces, one from each graph, which are vertex-disjoint.
Year
DOI
Venue
1998
10.1016/S0012-365X(97)00095-2
Discrete Mathematics
Keywords
Field
DocType
plane triangulation,edge-disjoint,maximal planar graph,edge-disjoint maximal planar graph,planar graph
Discrete mathematics,Combinatorics,Indifference graph,Clique-sum,Planar straight-line graph,Chordal graph,Book embedding,Pathwidth,1-planar graph,Mathematics,Maximal independent set
Journal
Volume
Issue
ISSN
179
1-3
Discrete Mathematics
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Sharon G. Boswell100.68
Jamie Simpson216421.41