Decompositions for edge-coloring join graphs and cobipartite graphs

DOI10.1016/J.DAM.2009.01.009zbMATH Open1218.05050OpenAlexW2031659811MaRDI QIDQ987682FDOQ987682

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)

Cites Work

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

Cited In (15)

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

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)