Construction of \(K_{n}\)-minor free graphs with given circular chromatic number

DOI10.1016/S0012-365X(02)00529-0zbMath1011.05060OpenAlexW2083271302MaRDI QIDQ1869205

Zhishi Pan, Sheng-Chyang Liaw, 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

zbMATH Keywords

circular chromatic numberplanar graphHadwiger conjecture\(K_{n}\)-minor free graphseries-parallel construction

Mathematics Subject Classification ID

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

Related Items (5)

Signed planar graphs with given circular chromatic numbers ⋮ Circular total chromatic numbers of graphs ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Circular chromatic indices of even degree regular graphs

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