Up-embeddability of a graph by order and girth

DOI10.1007/s00373-007-0746-8zbMath1130.05022OpenAlexW2083039657MaRDI QIDQ2464047

Yi-Chao Chen, Yanpei Liu

Publication date: 10 December 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0746-8

zbMATH Keywords

ordergirthmaximum genusup-embeddable

Mathematics Subject Classification ID

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

Related Items (2)

Up-embeddability of graphs with new degree-sum ⋮ Upper embeddability, edge independence number and girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• Bounds of the number of disjoint spanning trees
• On the maximum genus of a graph
• A Kuratowski-type theorem for the maximum genus of a graph
• On locally quasiconnected graphs and their upper embeddability
• A class of upper-embeddable graphs
• Every connected, locally connected graph is upper embeddable
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: Up-embeddability of a graph by order and girth