Pages that link to "Item:Q521809"
From MaRDI portal
The following pages link to Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809):
Displaying 6 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Biclique graphs of split graphs (Q2091808) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- (Q5501327) (← links)