Pages that link to "Item:Q4652597"
From MaRDI portal
The following pages link to Coloring the Maximal Cliques of Graphs (Q4652597):
Displaying 50 items.
- Maximum number of colors: C-coloring and related problems (Q408951) (← links)
- 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-relaxed graph coloring (Q656032) (← links)
- Clique colourings of geometric graphs (Q668027) (← links)
- On the partition and coloring of a graph by cliques (Q687122) (← links)
- Clique clustering yields a PTAS for max-coloring interval graphs (Q722535) (← 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)
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673) (← links)
- Maximum colorful cliques in vertex-colored graphs (Q1791008) (← links)
- Greedy algorithms for triangle free coloring (Q1927697) (← 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)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← 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)
- Critical graphs for clique-coloring (Q2816053) (← links)
- Clique-coloring circular-arc graphs (Q2840551) (← links)
- More Results on Clique-chromatic Numbers of Graphs with No Long Path (Q2945676) (← links)
- Clique Clustering Yields a PTAS for max-Coloring Interval Graphs (Q3012804) (← links)
- Clique-coloring some classes of odd-hole-free graphs (Q3419713) (← 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)