Partitions and edge colourings of multigraphs
zbMATH Open1160.05317MaRDI QIDQ1010682FDOQ1010682
Authors: Michael Stiebitz, Alexandr 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (20)
- Short fans and the 5/6 bound for line graphs
- Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- Some remarks on even-hole-free graphs
- A relaxed version of the Erdős-Lovász Tihany conjecture
- On multigraphs with a given partition
- Title not available (Why is that?)
- Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
- Edge-partitions of planar graphs and their game coloring numbers
- Colourings, homomorphisms, and partitions of transitive digraphs
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes
- Characterizing partition functions of the edge-coloring model by rank growth
- Title not available (Why is that?)
- Vertex colouring edge partitions
- Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
- Vertex partitions of \(r\)-edge-colored graphs
- Note on Cellular Structure of Edge Colored Partition Algebras
- Hajós' conjecture for line graphs
- Double-critical graph conjecture for claw-free graphs
This page was built for publication: Partitions and edge colourings of multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010682)
