Name
Abstract | ||
|---|---|---|
Suppose M = m(1), m(2),..., m(r) and N = n(1), n(2),..., n(t) are arbitrary lists of positive integers. In this article, we determine necessary and sufficient conditions on M and N for the existence of a simple graph G, which admits a face 2-colorable planar embedding in which the faces of one color have boundary lengths m(1), m(2),..., m(r) and the faces of the other color have boundary lengths n(1), n(2),..., n(t). Such a graph is said to have a planar (M; N)-biembedding. We also determine necessary and sufficient conditions on M and N for the existence of a simple graph G whose edge set can be partitioned into r cycles of lengths m(1), m(2),..., m(r) and also into t cycles of lengths n(1), n(2),..., nt. Such a graph is said to be (M; N)-decomposable. (C) 2015 Wiley Periodicals, Inc. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1002/jgt.21902 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
graph embedding,graph decomposition | Topology,Discrete mathematics,Combinatorics,Graph power,Planar straight-line graph,Cubic graph,Book embedding,Graph minor,Voltage graph,Planar graph,Mathematics,Complement graph | Journal |
Volume | Issue | ISSN |
82.0 | 3.0 | 0364-9024 |
Citations | PageRank | References |
1 | 0.37 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Barbara Maenhaut | 1 | 32 | 7.42 |
| Benjamin R. Smith | 2 | 27 | 5.66 |