Further remarks on partitioning the edges of a graph

DOI10.1016/0095-8956(78)90029-1zbMATH Open0375.05041OpenAlexW1967921025MaRDI QIDQ1245982FDOQ1245982

Authors: R. Jones, A. 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)90029-1

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

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

Cited In (1)

• Partitioning the edges of a graph

This page was built for publication: Further remarks on partitioning the edges of a graph

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