Partitions and edge colourings of multigraphs
From MaRDI portal
Publication:1010682
Recommendations
Cited in
(20)- Vertex colouring edge partitions
- Hajós' conjecture for line graphs
- Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes
- On multigraphs with a given partition
- Vertex partitions of \(r\)-edge-colored graphs
- Short fans and the 5/6 bound for line graphs
- Characterizing partition functions of the edge-coloring model by rank growth
- Note on Cellular Structure of Edge Colored Partition Algebras
- Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
- Some remarks on even-hole-free graphs
- scientific article; zbMATH DE number 4162925 (Why is no real title available?)
- The Erdős-Lovász tihany conjecture for quasi-line graphs
- scientific article; zbMATH DE number 4008444 (Why is no real title available?)
- Partition graphs of independence number \(2\) into two subgraphs with large chromatic numbers
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Enhancing the Erdős‐Lovász Tihany Conjecture for line graphs of multigraphs
- Double-critical graph conjecture for claw-free graphs
- Edge-partitions of planar graphs and their game coloring numbers
- Colourings, homomorphisms, and partitions of transitive digraphs
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)