Stratified graphs for imbedding systems
From MaRDI portal
Publication:1897429
DOI10.1016/0012-365X(94)00029-IzbMath0876.05028OpenAlexW2051233105MaRDI QIDQ1897429
Thomas W. Tucker, Jonathan L. Gross
Publication date: 27 August 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00029-i
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Region distributions of some small diameter graphs
- The construction and classification of self-dual spherical polyhedra
- Region distributions of graph embeddings and Stirling numbers
- Limit points for average genus. I: 3-connected and 2-connected simplicial graphs
- Genus distributions for two classes of graphs
- Permutation-partition pairs. III: Embedding distributions of linear families of graphs
- An upper bound for the average number of regions
- The medial graph and voltage-current duality
- Limit points for average genus. II: 2-connected non-simplicial graphs
- Kuratowski-type theorems for average genus
- Genus distributions for bouquets of circles
- Enumeration of graph embeddings
- On the average genus of a graph
- The graph genus problem is NP-complete
- On a Class of Fixed-Point-Free Graphs
- Local extrema in genus-stratified graphs
- Hierarchy for imbedding-distribution invariants of a graph
- Enumerating 2-Cell Imbeddings of Connected Graphs
- Counting Cycles in Permutations by Group Characters, With an Application to a Topological Problem
- Lower bounds for the average genus
This page was built for publication: Stratified graphs for imbedding systems
