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

DOI10.1007/978-3-540-85097-7_33MaRDI QIDQ5505673zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4132188 (Why is no real title available?)
• A Linear Recognition Algorithm for Cographs
• Complement reducible graphs
• 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
• On certain polytopes associated with graphs
• The NP-Completeness of Edge-Coloring
• The Solution of a Timetabling Problem
• The chromatic index of complete multipartite graphs

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)