Pages that link to "Item:Q896010"

The following pages link to Perfect graphs of arbitrarily large clique-chromatic number (Q896010):

Displaying 18 items.

• Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
• Clique coloring \(B_1\)-EPG graphs (Q512582) (← links)
• Clique colourings of geometric graphs (Q668027) (← links)
• Tight bounds on the clique chromatic number (Q820840) (← links)
• Structural parameterizations of clique coloring (Q832512) (← links)
• Lower bounds on the clique-chromatic numbers of some distance graphs (Q2043671) (← 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)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• New bounds on clique-chromatic numbers of Johnson graphs (Q2192124) (← 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)
• Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
• Random perfect graphs (Q4625032) (← links)
• (Q5089217) (← links)
• Tight asymptotics of clique‐chromatic numbers of dense random graphs (Q6074590) (← links)
• The jump of the clique chromatic number of random graphs (Q6076219) (← links)
• Discrepancy and sparsity (Q6615750) (← links)