Partitioning the edges of a graph

DOI10.1016/0095-8956(78)90004-7zbMath0411.05040OpenAlexW2067468322MaRDI QIDQ1259608

Rhys Price Jones, Anthony J. W. Hilton

Publication date: 1978

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(78)90004-7

zbMATH Keywords

colouringedge partition graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Further remarks on partitioning the edges of a graph

Cites Work

• Further remarks on partitioning the edges of a graph
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• Unnamed Item

This page was built for publication: Partitioning the edges of a graph