Pages that link to "Item:Q2883635"
From MaRDI portal
The following pages link to Total chromatic number of {square,unichord}-free graphs (Q2883635):
Displaying 4 items.
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- 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)
