Pages that link to "Item:Q2441644"
From MaRDI portal
The following pages link to Clique-transversal sets and clique-coloring in planar graphs (Q2441644):
Displaying 16 items.
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs (Q344543) (← links)
- 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 colourings of geometric graphs (Q668027) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Structural parameterizations of clique coloring (Q832512) (← links)
- On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
- A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
- Total coloring of claw-free planar graphs (Q2151210) (← links)
- A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
- The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- (Q5089217) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
