Pages that link to "Item:Q5925222"
From MaRDI portal
The following pages link to Colouring clique-hypergraphs of circulant graphs (Q5925222):
Displaying 7 items.
- Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Thresholds for the monochromatic clique transversal game (Q2695001) (← links)
- A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
- The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles (Q6550916) (← links)
