Maximum genus and girth of graphs

DOI10.1016/S0012-365X(98)00152-6zbMath0949.05017OpenAlexW1969919634MaRDI QIDQ1297489

Yuangqiu Huang

Publication date: 16 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00152-6

zbMATH Keywords

girthmaximum genus

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Maximum genus and chromatic number of graphs ⋮ Remarks on the lower bounds for the average genus ⋮ Unnamed Item ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ Maximum genus, girth and connectivity ⋮ Maximum genus, connectivity and minimal degree of graphs

Cites Work

• Unnamed Item
• How to determine the maximum genus of a graph
• Upper embeddability and connectivity of graphs
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• A new bound on the feedback vertex sets in cubic graphs
• Maximum genus and connectivity
• A tight lower bound on the maximum genus of a simplicial graph
• On the maximum genus of a graph
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: Maximum genus and girth of graphs