Edge-colouring of joins of regular graphs. II

DOI10.1007/s10878-011-9420-4zbMath1273.05064OpenAlexW2010600302MaRDI QIDQ1945699

Caterina De Simone, Anna Galluccio

Publication date: 8 April 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-011-9420-4

zbMATH Keywords

joinregular graphsedge-colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

On the chromatic index of cographs and join graphs ⋮ Edge-colouring graphs with bounded local degree sums ⋮ Graph edge coloring: a survey ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree

Cites Work

• Edge-colouring of joins of regular graphs. I
• Edge coloring regular graphs of high degree
• Edge-colouring of join graphs
• Edge-colouring of regular graphs of large degree
• Investigations on an edge coloring problem
• The NP-Completeness of Edge-Coloring
• The chromatic index of complete multipartite graphs
• The chromatic index of graphs of even order with many edges
• The Solution of a Timetabling Problem

This page was built for publication: Edge-colouring of joins of regular graphs. II