scientific article; zbMATH DE number 1472095
From MaRDI portal
Recommendations
Cited in
(7)- The P versus NP-complete dichotomy of some challenging problems in graph theory
- Edge-colouring graphs with bounded local degree sums
- Local Algorithms for Edge Colorings in UDGs
- Edge-colouring and total-colouring chordless graphs
- Chromatic index of graphs with no cycle with a unique chord
- On the chromatic index of cographs and join graphs
- The overfull conjecture on split-comparability and split-interval graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489142)