Pages that link to "Item:Q2294308"
From MaRDI portal
The following pages link to A linear-time algorithm for clique-coloring planar graphs (Q2294308):
Displaying 8 items.
- Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- Coloring Clique-free Graphs in Linear Expected Time (Q4019373) (← links)
- (Q5282663) (← links)