Decompositions for edge-coloring join graphs and cobipartite graphs

DOI10.1016/J.DAM.2009.01.009MaRDI QIDQ987682zbMATH OpenOpenAlexFDO

Authors R. C. S. Machado, Celina M. H. de Figueiredo

Publication date 13 August 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2009.01.009

zbMATH Keywords

coreedge-coloringchromatic indexjoin graphcobipartite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Sufficient conditions for a graph to be edge-colorable with maximum degree colors
• Edge-coloring of split graphs.
• On edge cover coloring of join graphs.
• The chromatic index of a graph whose core has maximum degree 2
• On the chromatic index of join graphs and triangle-free graphs with large maximum degree

Cites work

• scientific article; zbMATH DE number 3654142 (Why is no real title available?)
• scientific article; zbMATH DE number 749267 (Why is no real title available?)
• scientific article; zbMATH DE number 927053 (Why is no real title available?)
• A constructive proof of Vizing's theorem
• Edge-colouring of join graphs
• Méthode et théorème général de coloration des aretes d'un multigraphe
• NP-completeness of edge-colouring some restricted graphs
• The NP-Completeness of Edge-Coloring
• The chromatic index of a graph whose core has maximum degree two
• The chromatic index of complete multipartite graphs
• The chromatic index of graphs with a spanning star

Cited in

(18)

• Complexity-separating graph classes for vertex, edge and total colouring
• Colorful edge decomposition of graphs: some polynomial cases
• Edge-colouring of join graphs
• Edge-colouring graphs with bounded local degree sums
• Graph edge coloring: a survey
• Sufficient conditions for a graph to be edge-colorable with maximum degree colors
• Colored Modular and Split Decompositions of Graphs with Applications to Trigraphs
• The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark
• Group colorings and DP-colorings of multigraphs using edge-disjoint decompositions
• A connectivity-based decomposition for graph edge-colouring
• On edge cover coloring of join graphs.
• On the zero-divisor graphs of finite free semilattices
• Edge-colouring and total-colouring chordless graphs
• Chromatic index of graphs with no cycle with a unique chord
• The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal
• On the chromatic index of cographs and join graphs
• The overfull conjecture on split-comparability and split-interval graphs
• On the chromatic index of join graphs and triangle-free graphs with large maximum degree

This page was built for publication: Decompositions for edge-coloring join graphs and cobipartite graphs

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