Circular perfect graphs

DOI10.1002/jgt.20050zbMath1071.05037OpenAlexW4248510137MaRDI QIDQ4667799

Xuding Zhu

Publication date: 21 April 2005

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20050

zbMATH Keywords

circular chromatic numbercircular clique

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (18)

Clique and chromatic number of circular-perfect graphs ⋮ Claw‐free circular‐perfect graphs ⋮ The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities ⋮ Computing clique and chromatic number of circular-perfect graphs in polynomial time ⋮ Circular-imperfection of triangle-free graphs ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ On the theta number of powers of cycle graphs ⋮ On circular-perfect graphs: a survey ⋮ On minimally circular-imperfect graphs ⋮ On classes of minimal circular-imperfect graphs ⋮ Unnamed Item ⋮ Several parameters of generalized Mycielskians ⋮ Computing the clique number of \(a\)-perfect graphs in polynomial time ⋮ Claw-free circular-perfect graphs ⋮ Triangle-free strongly circular-perfect graphs ⋮ On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs ⋮ Minimally circular-imperfect graphs with a major vertex ⋮ On strongly circular-perfectness

This page was built for publication: Circular perfect graphs