Pages that link to "Item:Q3652547"
From MaRDI portal
The following pages link to Complexity of clique-coloring odd-hole-free graphs (Q3652547):
Displaying 22 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)
- A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Complexity of clique coloring and related problems (Q551168) (← links)
- Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← 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)
- 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)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- Clique-coloring claw-free graphs (Q2631088) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
- Perfect graphs with no balanced skew-partition are 2-clique-colorable (Q2800540) (← links)
- Clique-coloring some classes of odd-hole-free graphs (Q3419713) (← links)
- Odd Hole Recognition in Graphs of Bounded Clique Size (Q5470814) (← links)
- Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)