On the chromatic index of cographs and join graphs
From MaRDI portal
Publication:324879
DOI10.1016/J.ENDM.2015.07.072zbMath1347.05060OpenAlexW2210596961MaRDI QIDQ324879
Leandro M. Zatesko, Georgia Garcia, Alex R. Cunha Lima, Sheila Morais de Almeida
Publication date: 17 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.07.072
Related Items (3)
Edge-colouring graphs with bounded local degree sums ⋮ Classifying \(k\)-edge colouring for \(H\)-free graphs ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree
Cites Work
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Complement reducible graphs
- 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
- A Linear Recognition Algorithm for Cographs
- Four classes of perfectly orderable graphs
- The chromatic index of graphs with a spanning star
- The NP-Completeness of Edge-Coloring
- Unnamed Item
- Unnamed Item
This page was built for publication: On the chromatic index of cographs and join graphs