Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
From MaRDI portal
Publication:2075527
DOI10.1016/j.disc.2021.112781zbMath1482.05277OpenAlexW4200624296MaRDI QIDQ2075527
Publication date: 14 February 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112781
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitions and edge colourings of multigraphs
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- \(K_ 5\) is the only double-critical 5-chromatic graph
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes
- A Relaxed Version of the Erdős–Lovász Tihany Conjecture
- On odd circuits in chromatic graphs
- Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
This page was built for publication: Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers