The following pages link to (Q4016827):
Displaying 22 items.
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- On the complete width and edge clique cover problems (Q721937) (← links)
- Edge-clique covers of the tensor product (Q897963) (← links)
- Partition into cliques for cubic graphs: Planar case, complexity and approximation (Q947111) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- The complexity of generalized clique covering (Q1262127) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Some complexity results about threshold graphs (Q1327235) (← links)
- A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number (Q1799389) (← links)
- The complexity of cover graph recognition for some varieties of finite lattices (Q1908932) (← links)
- Fast constructive and improvement heuristics for edge clique covering (Q2019428) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Edge clique partition in \((k,\ell)\)-graphs (Q2243139) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Vertex Cover Gets Faster and Harder on Low Degree Graphs (Q2920457) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Complexity results for well‐covered graphs (Q3993632) (← links)
- (Q4223772) (← links)
- (Q4320673) (← links)
- (Q6168434) (← links)
