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

DOI10.1007/978-3-540-85097-7_33zbMATH Open1168.05309OpenAlexW1574813184MaRDI QIDQ5505673FDOQ5505673

Authors: Caterina De Simone, A. 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

Recommendations

• Edge-colouring of joins of regular graphs. I
• Edge-colouring of joins of regular graphs. II
• Edge-colouring of regular graphs of large degree
• Edge coloring regular graphs of high degree
• Total colorings of some join graphs

Mathematics Subject Classification ID

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

Cites Work

• Complement reducible graphs
• On certain polytopes associated with graphs
• The NP-Completeness of Edge-Coloring
• The chromatic index of complete multipartite graphs
• A Linear Recognition Algorithm for Cographs
• Edge-colouring of join graphs
• Investigations on an edge coloring problem
• The Solution of a Timetabling Problem
• Title not available (Why is that?)
• Edge coloring regular graphs of high degree
• Edge-colouring of regular graphs of large degree

Cited In (2)

• Edge-colouring of joins of regular graphs. I
• Edge-colouring of joins of regular graphs. II

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505673)