On the chromatic index of cographs and join graphs
From MaRDI portal
Publication:324879
Recommendations
Cites work
- scientific article; zbMATH DE number 1472095 (Why is no real title available?)
- scientific article; zbMATH DE number 3325507 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Complement reducible graphs
- Decompositions for edge-coloring join graphs and cobipartite graphs
- Edge-colouring of join graphs
- Edge-colouring of joins of regular graphs. II
- Four classes of perfectly orderable graphs
- How to find overfull subgraphs in graphs with large maximum degree
- Méthode et théorème général de coloration des aretes d'un multigraphe
- The NP-Completeness of Edge-Coloring
- The chromatic index of graphs with a spanning star
Cited in
(6)- Edge-colouring graphs with bounded local degree sums
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- scientific article; zbMATH DE number 4122017 (Why is no real title available?)
- On the coequal values of total chromatic number and chromatic index
- scientific article; zbMATH DE number 1472095 (Why is no real title available?)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree
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)