Upper embeddability and connectivity of graphs

DOI10.1016/0012-365X(79)90070-0zbMath0407.05028OpenAlexW2037920065MaRDI QIDQ1257900

Charles Payan, Nguyen Huy Xuong

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0012-365x(79)90070-0

zbMATH Keywords

GraphsConnectivityUpper Embeddability

Mathematics Subject Classification ID

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

Related Items (11)

Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Upper embeddability of graphs ⋮ The maximum genus of vertex-transitive graphs ⋮ A note on upper embeddable graphs ⋮ Survey of results on the maximum genus of a graph ⋮ Maximum genus and girth of graphs ⋮ Extensions on 2-edge connected 3-regular up-embeddable graphs ⋮ Face size and the maximum genus of a graph. I: Simple graphs ⋮ Lower bounds on the maximum genus of loopless multigraphs ⋮ A tight lower bound on the maximum genus of a 3-connected loopless multigraph ⋮ A tight lower bound on the maximum genus of \(3\)-edge connected loopless graphs

Cites Work

• On cycle permutation graphs
• Bounds of the number of disjoint spanning trees
• On the maximum genus of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper embeddability and connectivity of graphs