Pages that link to "Item:Q4652597"

The following pages link to Coloring the Maximal Cliques of Graphs (Q4652597):

Displaying 47 items.

• Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
• Biclique-colouring verification complexity and biclique-colouring power graphs (Q491598) (← links)
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
• Clique coloring \(B_1\)-EPG graphs (Q512582) (← 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)
• Claw-free cubic graphs with clique-transversal number half of their order (Q533447) (← links)
• Complexity of clique coloring and related problems (Q551168) (← links)
• Clique colourings of geometric graphs (Q668027) (← links)
• Algorithms for unipolar and generalized split graphs (Q741738) (← links)
• Tight bounds on the clique chromatic number (Q820840) (← links)
• Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
• Structural parameterizations of clique coloring (Q832512) (← links)
• Subgraph transversal of graphs (Q844218) (← links)
• Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← 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)
• Clique chromatic numbers of intersection graphs (Q2313617) (← links)
• The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
• Hitting all maximal independent sets of a bipartite graph (Q2354017) (← links)
• Coloring the cliques of line graphs (Q2401798) (← 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)
• A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
• Graphs with large clique-chromatic numbers (Q2788733) (← links)
• Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
• Clique-Coloring Circular-Arc Graphs (Q2840551) (← links)
• More Results on Clique-chromatic Numbers of Graphs with No Long Path (Q2945676) (← links)
• Clique-coloring UE and UEH graphs (Q3503551) (← links)
• Subgraph-avoiding coloring of graphs (Q3553235) (← links)
• Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
• Random perfect graphs (Q4625032) (← links)
• (Q5089217) (← links)
• (Q5155414) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5925222) (← 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)
• The \((a, b)\)-monochromatic transversal game on clique-hypergraphs of powers of cycles (Q6550916) (← links)
• On the complexity of local-equitable coloring in claw-free graphs with small degree (Q6616437) (← links)