A Nebeský-type characterization for relative maximum genus

DOI10.1006/jctb.1997.1810zbMath0920.05021OpenAlexW2016149093MaRDI QIDQ1272649

C. Paul Bonnington, Dan S. Archdeacon, Jozef Širáň

Publication date: 3 January 1999

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/25506ab8365be1a2256b843277056f8416addc55

zbMATH Keywords

embeddingmaximum genusclosed walks

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75)

Related Items (2)

Odd components of co-trees and graph embeddings ⋮ Maximum genus embeddings of Steiner triple systems

Cites Work

• Characterization of the maximum genus of a signed graph
• How to determine the maximum genus of a graph
• The relative maximum genus of a graph
• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• Relative Embeddings of Graphs on Closed Surfaces
• Permutation-Partition Pairs: A Combinatorial Generalization of Graph Embeddings
• A new characterization of the maximum genus of a graph
• The Genus, Regional Number, and Betti Number of a Graph

This page was built for publication: A Nebeský-type characterization for relative maximum genus