Canonical edge-colourings of locally finite graphs

DOI10.1007/BF02579280zbMath0494.05021OpenAlexW2014072867MaRDI QIDQ1168978

Anthony J. W. Hilton

Publication date: 1982

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579280

zbMATH Keywords

chromatic indexmaximum degreeproper edge coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Unnamed Item, Multiply balanced edge colorings of multigraphs, Equitable factorizations of edge-connected graphs, Graph factors and factorization: 1985--2003: a survey, Quasi-Eulerian hypergraphs, Internally fair factorizations and internally fair holey factorizations with prescribed regularity, Regular and canonical colorings, The total chromatic number of complete multipartite graphs with low deficiency, Almost Every Graph can be Covered by Linear Forests, On evenly-equitable, balanced edge-colorings and related notions, Unnamed Item, Hamilton decompositions of balanced complete multipartite graphs with primitive leaves, Unnamed Item, Hamilton decompositions of graphs with primitive complements

Cites Work

• A selection lemma
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• How to colour the lines of a bigraph
• Axiomatic Treatment of Rank in Infinite Sets
• Unnamed Item
• Unnamed Item