The maximum genus of graph bundles

DOI10.1016/S0195-6698(88)80012-XzbMath0642.05019OpenAlexW2088955853MaRDI QIDQ1101120

Bojan Mohar, Martin Škoviera, Tomaž Pisanski

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/s0195-6698(88)80012-x

zbMATH Keywords

upper embeddabilitygraph bundles

Mathematics Subject Classification ID

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

Related Items (14)

Embedding grid graphs on surfaces ⋮ Weighted complexities of graph products and bundles ⋮ On strong graph bundles ⋮ Isoperimetric numbers of graph bundles ⋮ Unnamed Item ⋮ Nowhere-zero flows in Cartesian bundles of graphs ⋮ Coloring graph bundles ⋮ Graph bundles and Ricci‐flatness ⋮ Flow modules and nowhere-zero flows ⋮ Distance-residual subgraphs ⋮ Characteristic polynomials of graph bundles having voltages in a dihedral group ⋮ Perfect domination sets in Cayley graphs ⋮ The chromatic numbers of graph bundles over cycles ⋮ Bipartite graph bundles with connected fibres

Cites Work

• Unnamed Item
• Unnamed Item
• Non-separating induced cycles in graphs
• Generating all graph coverings by permutation voltage assignments
• How to determine the maximum genus of a graph
• Edge-colorability of graph bundles
• Bounds of the number of disjoint spanning trees
• A new characterization of the maximum genus of a graph
• The Maximum Genus of Cartesian Products of Graphs
• A Characterization in of Upper-Embeddable Graphs

This page was built for publication: The maximum genus of graph bundles