Partitioning the edges of a graph

DOI10.1016/0095-8956(78)90004-7MaRDI QIDQ1259608zbMATH OpenOpenAlexFDO

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)90004-7

zbMATH Keywords

colouringedge partition graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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
• Further remarks on partitioning the edges of a graph
• On bounds for the incidentor chromatic number of a directed weighted multigraph

Cited in

(1)

• Further remarks on partitioning the edges of a graph

This page was built for publication: 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 Q1259608)