On the chromatic index of cographs and join graphs
From MaRDI portal
Publication:324879
DOI10.1016/J.ENDM.2015.07.072zbMATH Open1347.05060OpenAlexW2210596961MaRDI QIDQ324879FDOQ324879
Authors: Alex R. Cunha Lima, Georgia Garcia, Leandro M. Zatesko, Sheila M. de Almeida 
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.072
Recommendations
Cites Work
- Complement reducible graphs
- The NP-Completeness of Edge-Coloring
- A Linear Recognition Algorithm for Cographs
- Méthode et théorème général de coloration des aretes d'un multigraphe
- How to find overfull subgraphs in graphs with large maximum degree
- Edge-colouring of joins of regular graphs. II
- Edge-colouring of join graphs
- Four classes of perfectly orderable graphs
- The chromatic index of graphs with a spanning star
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decompositions for edge-coloring join graphs and cobipartite graphs
Cited In (6)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
- On the coequal values of total chromatic number and chromatic index
- Edge-colouring graphs with bounded local degree sums
- Title not available (Why is that?)
- Title not available (Why is that?)
- Classifying \(k\)-edge colouring for \(H\)-free graphs
This page was built for publication: On the chromatic index of cographs and join graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324879)
