Face size and the maximum genus of a graph. I: Simple graphs
From MaRDI portal
Publication:1850506
DOI10.1006/jctb.2000.1990zbMath1027.05031OpenAlexW2054650389MaRDI QIDQ1850506
Publication date: 10 December 2002
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.2000.1990
Related Items (4)
Unnamed Item ⋮ Results of the maximum genus of graphs ⋮ Up-embeddability via girth and the degree-sum of adjacent vertices ⋮ Face size and the maximum genus of a graph. I: Simple graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum genus of vertex-transitive graphs
- Embeddings of graphs with no short noncontractible cycles
- How to determine the maximum genus of a graph
- Upper embeddability and connectivity of graphs
- Face size and the maximum genus of a graph. I: Simple graphs
- The maximum genus of graphs of diameter two
- On the maximum genus of a graph
- A note on upper embeddable graphs
- On locally quasiconnected graphs and their upper embeddability
- A new characterization of the maximum genus of a graph
- A Characterization in of Upper-Embeddable Graphs
This page was built for publication: Face size and the maximum genus of a graph. I: Simple graphs