Circular perfect graphs

DOI10.1002/JGT.20050MaRDI QIDQ4667799zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 5531989
• Circular-Perfect Concave-Round Graphs
• Some results on circular perfect graphs and perfect graphs
• On circular-perfect graphs: a survey
• Convex-round graphs are circular-perfect
• Circumdetic graphs
• Circular-imperfection of triangle-free graphs
• Perfect graphs
• scientific article; zbMATH DE number 4065042
• scientific article; zbMATH DE number 3851153

Cited in

(26)

• Claw-free circular-perfect graphs
• Triangle-free strongly circular-perfect graphs
• On strongly circular-perfectness
• On circular critical graphs
• Circular-imperfection of triangle-free graphs
• Minimal circular-imperfect graphs of large clique number and large independence number
• Several parameters of generalized Mycielskians
• Computing the clique number of \(a\)-perfect graphs in polynomial time
• Graphs whose circular clique number equals the clique number
• Minimally circular-imperfect graphs with a major vertex
• On classes of minimal circular-imperfect graphs
• scientific article; zbMATH DE number 5531989 (Why is no real title available?)
• Circular-Perfect Concave-Round Graphs
• On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs
• Clique and chromatic number of circular-perfect graphs
• Convex-round graphs are circular-perfect
• Claw-free circular-perfect graphs
• The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities
• On circular-perfect graphs: a survey
• On the theta number of powers of cycle graphs
• scientific article; zbMATH DE number 2151259 (Why is no real title available?)
• Computing the clique number of a-perfect graphs in polynomial time
• Some results on circular perfect graphs and perfect graphs
• On minimally circular-imperfect graphs
• Computing clique and chromatic number of circular-perfect graphs in polynomial time
• \(C\)-perfect \(K\)-uniform hypergraphs.

This page was built for publication: Circular perfect graphs

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