A Relaxed Version of the Erdős–Lovász Tihany Conjecture
From MaRDI portal
Publication:5272646
DOI10.1002/jgt.22060zbMath1365.05104OpenAlexW2423486630WikidataQ122963177 ScholiaQ122963177MaRDI QIDQ5272646
Publication date: 30 June 2017
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.22060
Related Items
Some remarks on even-hole-free graphs, Critical graphs for the chromatic edge-stability number, Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs, Decomposing edge-colored graphs under color degree constraints, Partition line graphs of multigraphs into two subgraphs with large chromatic numbers, On splitting digraphs, Double-critical graph conjecture for claw-free graphs, Erdős-Lovász Tihany conjecture for graphs with forbidden holes, Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Disjoint cycles in digraphs
- Partition of graphs with condition on the connectivity and minimum degree
- Double-critical graphs and complete minors
- 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
- Graph decomposition with constraints on the connectivity and minimum degree
- On decomposition of triangle-free graphs under degree constraints
- Decomposing graphs with girth at least five under degree constraints
- On chromatic number of graphs and set-systems
- An inequality for the chromatic number of a graph
- On odd circuits in chromatic graphs