Perfect graphs with no balanced skew-partition are 2-clique-colorable

DOI10.1002/JGT.21870MaRDI QIDQ2800540zbMATH OpenOpenAlexFDO

Authors Irena Penev

Publication date 15 April 2016

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

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

zbMATH Keywords

clique-chromatic numberstrong perfect graph theorem

Mathematics Subject Classification ID

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

Recommendations

• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• Colouring perfect graphs with bounded clique number
• Coloring the Maximal Cliques of Graphs

Cites work

• Almost all Berge Graphs are Perfect
• Berge trigraphs
• Characterizations of derived graphs
• Claw-free graphs. V. Global structure
• Clique-coloring some classes of odd-hole-free graphs
• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• Clique-transversal sets of line graphs and complements of line graphs
• Coloring the Maximal Cliques of Graphs
• Coloring the hypergraph of maximal cliques of a graph with no long path
• Combinatorial optimization with 2-joins
• Complexity of clique-coloring odd-hole-free graphs
• Decomposing Berge graphs and detecting balanced skew partitions
• Recognizing Berge graphs
• Sur le coloriage des graphs
• The strong perfect graph theorem
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• The structure of bull-free graphs II and III -- a summary
• Transitiv orientierbare Graphen
• Two-colouring all two-element maximal antichains

Cited in

(10)

• Clique-stable set separation in perfect graphs with no balanced skew-partitions
• A linear-time algorithm for clique-coloring planar graphs
• List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
• Perfect graphs of arbitrarily large clique-chromatic number
• Equitable clique-coloring in claw-free graphs with maximum degree at most 4
• Colouring perfect graphs with bounded clique number
• scientific article; zbMATH DE number 7559420 (Why is no real title available?)
• Structural parameterizations of clique coloring
• On the complexity of local-equitable coloring of graphs
• A generalization of Grötzsch Theorem on the local-equitable coloring

This page was built for publication: Perfect graphs with no balanced skew-partition are 2-clique-colorable

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