Upper-embeddable graphs and related topics

DOI10.1016/0095-8956(79)90059-5zbMath0403.05036OpenAlexW1990733696MaRDI QIDQ1255963

Nguyen Huy Xuong

Publication date: 1979

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(79)90059-5

zbMATH Keywords

Maximum Genus ParameterSpanning TreesUpper-Embeddable Graphs

Mathematics Subject Classification ID

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

Related Items (11)

A tight lower bound on the maximum genus of a simplicial graph ⋮ Unnamed Item ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ A class of upper-embeddable graphs ⋮ The maximum genus of graphs of diameter two ⋮ The maximum genus of a 3-regular simplicial graph ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Clustering analysis of a dissimilarity: a review of algebraic and geometric representation ⋮ Upper embeddability, edge independence number and girth ⋮ The maximum genus of graphs with diameter three ⋮ Lower bounds on the maximum genus of loopless multigraphs

Cites Work

• 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
• Additivity of the genus of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper-embeddable graphs and related topics