The chromatic numbers of graph bundles over cycles

DOI10.1016/0012-365X(94)00212-2zbMath0818.05035OpenAlexW2139305836MaRDI QIDQ1842173

Bojan Mohar, Sandi Klavžar

Publication date: 6 August 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00212-2

zbMATH Keywords

cycleschromatic numbersgraph bundlesproduct bundles

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Algorithm for recognizing Cartesian graph bundles ⋮ Recognizing Cartesian graph bundles ⋮ On domination numbers of graphs bundles ⋮ On strong graph bundles ⋮ Unnamed Item ⋮ Nowhere-zero flows in Cartesian bundles of graphs ⋮ Graph bundles and Ricci‐flatness ⋮ Flow modules and nowhere-zero flows ⋮ Chromatic numbers of quadrangulations on closed surfaces ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ Coloring locally bipartite graphs on surfaces. ⋮ Circular flows of nearly Eulerian graphs and vertex-splitting

Cites Work

• Two remarks on retracts of graph products
• The maximum genus of graph bundles
• n-tuple colorings and associated graphs
• r-tuple colorings of uniquely colorable graphs
• Strong products of \(\chi\)-critical graphs
• Edge-colorability of graph bundles
• The chromatic number and other functions of the lexicographic product
• Graphs with Given Group and Given Graph-Theoretical Properties
• Coloring graph bundles
• Isomorphism Classes of Graph Bundles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic numbers of graph bundles over cycles