Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
From MaRDI portal
Publication:2800540
DOI10.1002/jgt.21870zbMath1381.05025OpenAlexW1557323685MaRDI QIDQ2800540
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
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Related Items
Clique-stable set separation in perfect graphs with no balanced skew-partitions, Structural parameterizations of clique coloring, Equitable clique-coloring in claw-free graphs with maximum degree at most 4, Unnamed Item, A linear-time algorithm for clique-coloring planar graphs, List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly, On the complexity of local-equitable coloring of graphs, A generalization of Grötzsch Theorem on the local-equitable coloring
Cites Work
- Clique-stable set separation in perfect graphs with no balanced skew-partitions
- Combinatorial optimization with 2-joins
- 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
- Clique-transversal sets of line graphs and complements of line graphs
- The strong perfect graph theorem
- Claw-free graphs. V. Global structure
- Two-colouring all two-element maximal antichains
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Decomposing Berge graphs and detecting balanced skew partitions
- Recognizing Berge graphs
- Clique-coloring some classes of odd-hole-free graphs
- Complexity of clique-coloring odd-hole-free graphs
- Almost all Berge Graphs are Perfect
- Coloring the Maximal Cliques of Graphs
- Berge trigraphs
- Transitiv orientierbare Graphen
- Characterizations of derived graphs
- Sur le coloriage des graphs
