Partitioning graphs into complete and empty graphs
From MaRDI portal
Publication:1045126
DOI10.1016/j.disc.2008.06.027zbMath1186.05095OpenAlexW1979114268MaRDI QIDQ1045126
Publication date: 15 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.06.027
Related Items (4)
Colourings, homomorphisms, and partitions of transitive digraphs ⋮ On equistable, split, CIS, and related classes of graphs ⋮ Advances on defective parameters in graphs ⋮ Stable-\(\Pi\) partitions of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On critical subgraphs of colour-critical graphs
- The strong perfect graph theorem
- On split-coloring problems
- Some simplified NP-complete graph problems
- The complexity of some problems related to GRAPH 3-COLORABILITY
- On cocolourings and cochromatic numbers of graphs
- Parallel concepts in graph theory
- Partitioning chordal graphs into independent sets and cliques
- Partitioning permutations into increasing and decreasing subsequences
- Partitions of graphs into one or two independent sets and cliques
- Partitioning cographs into cliques and stable sets
- Graph Theory and Probability
- Some extremal results in cochromatic and dichromatic theory
- Graph Classes: A Survey
- Small graphs with chromatic number 5: A computer search
- List Partitions
- The Ramsey number R(3, t) has order of magnitude t2/log t
- On the approximation of Min Split-coloring and Min Cocoloring
- Sur le coloriage des graphs
- Combinatorial Relations and Chromatic Graphs
This page was built for publication: Partitioning graphs into complete and empty graphs
