The chromatic numbers of double coverings of a graph

DOI10.1016/j.disc.2007.09.024zbMath1158.05026arXivmath/0507110OpenAlexW1977559902MaRDI QIDQ2519824

Jaeun Lee, Dong Seok Kim

Publication date: 27 January 2009

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

Full work available at URL: https://arxiv.org/abs/math/0507110

zbMATH Keywords

chromatic numbersdouble coverings

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Uses Software

• PSTricks

Cites Work

• Signatures and signed switching classes
• Generating all graph coverings by permutation voltage assignments
• Bipartite covering graphs
• Caracteristics polynomials of some grap bundlesII
• Characteristic polynomials of graph coverings
• Random lifts of graphs: Independence and chromatic number
• Isomorphism Classes of Graph Bundles
• ENUMERATION OF HOMOMORPHISMS AND SURFACE-COVERINGS
• Map-Colour Theorems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic numbers of double coverings of a graph