Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
From MaRDI portal
Publication:4099664
DOI10.1112/jlms/s2-12.1.123zbMath0334.05106OpenAlexW2045883663MaRDI QIDQ4099664
Publication date: 1975
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s2-12.1.123
Related Items (17)
Polychromatic colorings of hypergraphs with high balance ⋮ Edge covering coloring of nearly bipartite graphs ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Regular and canonical colorings ⋮ On edge covering colorings of graphs ⋮ The method of coloring in graphs and its application ⋮ The chromatic index of multigraphs that are nearly full ⋮ Obstructions for regular colorings ⋮ Canonical edge-colourings of locally finite graphs ⋮ A special \(f\)-edge cover-coloring of multigraphs ⋮ On the number of 1-factorizations of the complete graph ⋮ Fractional \(f\)-edge cover chromatic index of graphs ⋮ Multigraphs with quasiweak odd cycles ⋮ Further remarks on partitioning the edges of a graph ⋮ Partitioning the edges of a graph ⋮ A generalization of chromatic index ⋮ A sufficient condition for equitable edge-colourings of simple graphs
This page was built for publication: Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
