Construction of K_n-minor free graphs with given circular chromatic number

DOI10.1016/S0012-365X(02)00529-0zbMATH Open1011.05060OpenAlexW2083271302MaRDI QIDQ1869205FDOQ1869205

Authors: Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu 

Publication date: 9 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(02)00529-0

Recommendations

• Circular chromatic number and graph minors
• Graphs whose circular chromatic number equals the chromatic number
• On chromatic numbers of two extensions of planar graphs
• A simple proof of Moser's theorem
• Circular colouring and graph homomorphism

zbMATH Keywords

planar graphcircular chromatic numberHadwiger conjecture\(K_{n}\)-minor free graphseries-parallel construction

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cited In (7)

• Circular chromatic number and graph minors
• Signed planar graphs with given circular chromatic numbers
• On chromatic numbers of two extensions of planar graphs
• Circular chromatic indices of regular graphs
• The circular chromatic numbers of signed series-parallel graphs
• Circular chromatic indices of even degree regular graphs
• Circular total chromatic numbers of graphs

This page was built for publication: Construction of \(K_{n}\)-minor free graphs with given circular chromatic number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869205)