Partition line graphs of multigraphs into two subgraphs with large chromatic numbers

DOI10.1016/j.dam.2023.12.005OpenAlexW4389481708MaRDI QIDQ6153466

Jian Xi Li, Jian-Bo Lv

Publication date: 14 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.12.005

zbMATH Keywords

partitionedge-coloringline graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• 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 line graphs of multigraphs into two subgraphs with large chromatic numbers