Pages that link to "Item:Q2184678"
From MaRDI portal
The following pages link to Complexity-separating graph classes for vertex, edge and total colouring (Q2184678):
Displaying 4 items.
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Complexity separating classes for edge-colouring and total-colouring (Q2391946) (← links)
- On the complexity of colouring antiprismatic graphs (Q2659773) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)