On cubic graphs which are irreducible for nonorientable surfaces
From MaRDI portal
Publication:1066151
DOI10.1016/0095-8956(85)90053-XzbMATH Open0578.05018OpenAlexW1964832888MaRDI QIDQ1066151FDOQ1066151
Authors: Dan S. Archdeacon, John Philip Huneke
Publication date: 1985
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(85)90053-x
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- 103 graphs that are irreducible for the projective plane
- Additivity of the genus of a graph
- Title not available (Why is that?)
- Generalized Embedding Schemes
- Blocks and the nonorientable genus of graphs
- Graphs with bounded valency that do not embed in the projective plane
- Irreducible graphs
- Title not available (Why is that?)
Cited In (6)
- Irreducibility of the Tutte polynomial of an embedded graph
- Obstructions for embedding cubic graphs on the spindle surface
- Kuratowski-type theorems do not extend to pseudosurfaces
- A Kuratowski theorem for nonorientable surfaces
- Cubic graphs and related triangulations on orientable surfaces
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: On cubic graphs which are irreducible for nonorientable surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1066151)