Perfect graphs with no balanced skew-partition are 2-clique-colorable
From MaRDI portal
Publication:2800540
DOI10.1002/JGT.21870zbMATH Open1381.05025OpenAlexW1557323685MaRDI QIDQ2800540FDOQ2800540
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
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
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)
Cites Work
- Sur le coloriage des graphs
- Decomposing Berge graphs and detecting balanced skew partitions
- Clique-stable set separation in perfect graphs with no balanced skew-partitions
- Berge trigraphs
- Characterizations of derived graphs
- 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
- The strong perfect graph theorem
- Claw-free graphs. V. Global structure
- Recognizing Berge graphs
- Transitiv orientierbare Graphen
- Clique-transversal sets of line graphs and complements of line graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- Coloring the Maximal Cliques of Graphs
- Complexity of clique-coloring odd-hole-free graphs
- Combinatorial optimization with 2-joins
- Two-colouring all two-element maximal antichains
- Clique-coloring some classes of odd-hole-free graphs
- Almost all Berge Graphs are Perfect
Cited In (8)
- 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
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4
- Title not available (Why is that?)
- 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)
