Pages that link to "Item:Q3652547"

The following pages link to Complexity of clique-coloring odd-hole-free graphs (Q3652547):

Displaying 17 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)
• Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← 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)
• 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)
• Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)