Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it

DOI10.1112/JLMS/S2-12.1.123MaRDI QIDQ4099664zbMATH OpenOpenAlexFDO

Authors A. J. W. Hilton

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(17)

• Regular and canonical colorings
• Obstructions for regular colorings
• Canonical edge-colourings of locally finite graphs
• On the number of 1-factorizations of the complete graph
• 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
• On edge covering colorings of graphs
• Fractional \(f\)-edge cover chromatic index of graphs
• Polychromatic colorings of hypergraphs with high balance
• Facially-constrained colorings of plane graphs: a survey
• The method of coloring in graphs and its application
• Edge covering coloring of nearly bipartite graphs
• The chromatic index of multigraphs that are nearly full
• A special \(f\)-edge cover-coloring of multigraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099664)