Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs

DOI10.1002/jgt.22816zbMath1522.05144arXiv2008.08015WikidataQ113915820 ScholiaQ113915820MaRDI QIDQ6081894

Gexin Yu, Unnamed Author

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.08015

zbMATH Keywords

edge-coloringline graphsErdős-Lovász Tihany conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Partition line graphs of multigraphs into two subgraphs with large chromatic numbers ⋮ Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers

Cites Work

• Unnamed Item
• Unnamed Item
• Double-critical graph conjecture for claw-free graphs
• Complete and almost complete minors in double-critical 8-chromatic graphs
• 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
• Erdős-Lovász Tihany conjecture for graphs with forbidden holes
• On triangles in ‐minor free graphs
• Clique minors in double‐critical graphs
• A Relaxed Version of the Erdős–Lovász Tihany Conjecture
• On odd circuits in chromatic graphs
• A Theorem on Coloring the Lines of a Network

This page was built for publication: Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs