Partitions and edge colourings of multigraphs
From MaRDI portal
Publication:1010682
zbMath1160.05317MaRDI QIDQ1010682
Michael Stiebitz, Alexandr V. Kostochka
Publication date: 7 April 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/129819
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (8)
Some remarks on even-hole-free graphs ⋮ Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs ⋮ Partition line graphs of multigraphs into two subgraphs with large chromatic numbers ⋮ 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 ⋮ The Erdős-Lovász tihany conjecture for quasi-line graphs ⋮ A Relaxed Version of the Erdős–Lovász Tihany Conjecture
This page was built for publication: Partitions and edge colourings of multigraphs