A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs

DOI10.1007/978-3-540-85097-7_33zbMath1168.05309OpenAlexW1574813184MaRDI QIDQ5505673

Caterina De Simone, Anna Galluccio

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_33

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Complement reducible graphs
• Edge coloring regular graphs of high degree
• On certain polytopes associated with graphs
• Edge-colouring of join graphs
• Edge-colouring of regular graphs of large degree
• Investigations on an edge coloring problem
• A Linear Recognition Algorithm for Cographs
• The NP-Completeness of Edge-Coloring
• The chromatic index of complete multipartite graphs
• The Solution of a Timetabling Problem

This page was built for publication: A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs