Pages that link to "Item:Q2391946"
From MaRDI portal
The following pages link to Complexity separating classes for edge-colouring and total-colouring (Q2391946):
Displaying 7 items.
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Two complexity results for the vertex coloring problem (Q505438) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation (Q1774528) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Total chromatic number of \{square,unichord\}-free graphs (Q2883635) (← links)