Maximum genus, girth and connectivity

DOI10.1006/eujc.1999.0398zbMath0960.05040OpenAlexW2067760896MaRDI QIDQ1580675

Deming Li, Yanpei Liu

Publication date: 10 May 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1999.0398

zbMATH Keywords

connectivitygirthmaximum genusBetti number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (3)

Automorphisms of Cayley graphs of metacyclic groups of prime-power order ⋮ On the lower bounds for the maximum genus for simple graphs ⋮ On the automorphism groups of vertex-transitive Cayley digraphs of monoids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to determine the maximum genus of a graph
• The maximum genus of graphs with diameter three
• Maximum genus and girth of graphs
• Maximum genus and maximum nonseparating independent set of a 3-regular graph
• Bounds of the number of disjoint spanning trees
• 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
• A Kuratowski-type theorem for the maximum genus of a graph
• A new characterization of the maximum genus of a graph
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: Maximum genus, girth and connectivity