Edge-colouring of joins of regular graphs. I

DOI10.1007/s10878-009-9235-8zbMath1214.05025OpenAlexW3021046945MaRDI QIDQ849137

Anna Galluccio, Caterina De Simone

Publication date: 24 February 2010

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

Full work available at URL: https://doi.org/10.1007/s10878-009-9235-8

zbMATH Keywords

joinedge-colouringregular graph

Mathematics Subject Classification ID

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

Related Items

Edge-colouring of joins of regular graphs. I ⋮ Edge-colouring graphs with bounded local degree sums ⋮ Edge-colouring of joins of regular graphs. II

Cites Work

• Edge-colouring of joins of regular graphs. I
• Complement reducible graphs
• Edge coloring regular graphs of high degree
• On certain polytopes associated with graphs
• How to find overfull subgraphs in graphs with large maximum degree. II
• Edge-colouring of join graphs
• Edge-colouring of regular graphs of large degree
• Investigations on an edge coloring problem
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• The chromatic index of graphs with a spanning star
• The NP-Completeness of Edge-Coloring
• Odd Minimum Cut-Sets and b-Matchings
• The chromatic index of complete multipartite graphs
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• The chromatic index of graphs of even order with many edges
• The Solution of a Timetabling Problem