Name
Abstract | ||
|---|---|---|
Let G be a graph embedded in the sphere. A k-nest of a point x not in G is a collection C1,....,Ck of disjoint cycles such that for each Ci, the side containing x also contains Cj for each j i. An embedded graph is k-nested if each point not on the graph has a k-nest. In this paper we examine k-nested maps. We find the minor-minimal k-nested maps small values of k. In particular, we find the obstructions (under the minor order) for the class of planar maps with the property that one face's boundary meets all other face boundaries. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(01)00072-3 | Discrete Mathematics |
Keywords | Field | DocType |
nesting point,minor-minimal k-nested map,small value,planar map,collection c1,k-nested map,disjoint cycle,j i,face boundary,embedded graph,minor order,graph embedding | Discrete mathematics,Combinatorics,Edge-transitive graph,Graph power,Graph factorization,Planar straight-line graph,Regular graph,Graph minor,Mathematics,Planar graph,Complement graph | Journal |
Volume | Issue | ISSN |
244 | 1-3 | Discrete Mathematics |
Citations | PageRank | References |
1 | 0.36 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dan Archdeacon | 1 | 277 | 50.72 |
| Feliu Sagols | 2 | 2 | 1.43 |