Edge-colouring of join graphs

DOI10.1016/J.TCS.2005.12.010MaRDI QIDQ2369004zbMATH OpenOpenAlexFDO

Authors Caterina De Simone, Célia P. de Mello

Publication date 28 April 2006

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2005.12.010

zbMATH Keywords

Edge-colouringsJoin graphsOverfull graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Edge-colouring of joins of regular graphs. I
• Edge-colouring of joins of regular graphs. II
• On edge cover coloring of join graphs.
• Total colorings of some join graphs
• Join colourings of chordal graphs
• Incidence coloring of the join graphs
• scientific article; zbMATH DE number 68344
• Edge-coloring of multigraphs
• An edge colouring of multigraphs
• Decompositions for edge-coloring join graphs and cobipartite graphs

Cites work

• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Critical star multigraphs
• Edge coloring regular graphs of high degree
• Graphs which are vertex-critical with respect to the edge-chromatic number
• How to find overfull subgraphs in graphs with large maximum degree. II
• scientific article; zbMATH DE number 4132188 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3428958 (Why is no real title available?)
• NP-completeness of edge-colouring some restricted graphs
• Odd Minimum Cut-Sets and b-Matchings
• Regular Graphs of High Degree are 1-Factorizable
• The chromatic index of complete multipartite graphs
• The chromatic index of graphs with a spanning star
• The chromatic index of graphs with large maximum degree
• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
• The NP-Completeness of Edge-Coloring
• The Solution of a Timetabling Problem

Cited in

(17)

• On the chromatic index of join graphs and triangle-free graphs with large maximum degree
• The P versus NP-complete dichotomy of some challenging problems in graph theory
• Edge-colouring of joins of regular graphs. II
• Complexity-separating graph classes for vertex, edge and total colouring
• Edge-colouring graphs with bounded local degree sums
• Chromatic index of graphs with no cycle with a unique chord
• Edge-colouring of regular graphs of large degree
• Total colorings of some join graphs
• On the chromatic index of cographs and join graphs
• Sufficient conditions for a graph to be edge-colorable with maximum degree colors
• Edge-colouring and total-colouring chordless graphs
• On Colouring Partial Joins of a Complete Graph and a Cycle
• The number of disjoint perfect matchings in semi-regular graphs
• A Combinatorial Algorithm to Optimally Colour the Edges of the Graphs That Are Join of Regular Graphs
• On the edge chromatic vertex stability number of graphs
• Edge-colouring of joins of regular graphs. I
• Decompositions for edge-coloring join graphs and cobipartite graphs

This page was built for publication: Edge-colouring of join graphs

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