The following pages link to (Q3035328):
Displaying 20 items.
- A generalization of chordal graphs and the maximum clique problem (Q287036) (← links)
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- On the equivalence covering number of splitgraphs (Q673014) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- Dominating cliques in chordal graphs (Q1322189) (← links)
- Clique covering and clique partition in generalizations of line graphs (Q1343162) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Computing square roots of trivially perfect and threshold graphs (Q2446337) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Clique Covering of Graphs IV. Algorithms (Q3340897) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Clique covering and neighborhood covering in chordal graphs (Q3984949) (← links)
- (Q4014314) (← links)
- (Q5092371) (← links)