On the chromatic index of path decompositions

DOI10.1016/j.disc.2003.11.027zbMath1049.05032OpenAlexW2073783222MaRDI QIDQ1876679

Gaetano Quattrocchi, Eric Mendelsohn, Peter Danziger

Publication date: 20 August 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.027

zbMATH Keywords

Chromatic indexGraph decompositionsGraph colouringsGraph designsPath designs

Mathematics Subject Classification ID

Other designs, configurations (05B30) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Block colourings of star systems ⋮ Automorphic decompositions of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hanani triple systems
• Existence of resolvable path designs
• Resolvable path designs
• Graph properties and hypergraph colourings
• On path factorizations of complete multipartite graphs
• On the edge-coloring property for Hanani triple systems
• Graph decompositions, handcuffed prisoners and balanced p-designs
• Almost resolvable P_k‐decompositions of complete graphs
• On Mutually Orthogonal Resolutions and Near-Resolutions
• Handcuffed designs
• Handcuffed designs

This page was built for publication: On the chromatic index of path decompositions