The following pages link to On the Decomposition of Graphs (Q3964612):
Displaying 22 items.
- Pairwise balanced designs and sigma clique partitions (Q271601) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Spectral radius and clique partitions of graphs (Q820994) (← links)
- Clique partitions of distance multigraphs (Q932596) (← links)
- Extensions of networks with given diameter (Q1123211) (← links)
- Proof of a conjecture of Katona and Tarjan (Q1137599) (← links)
- Examples of products giving large graphs with given degree and diameter (Q1199421) (← links)
- Restricted greedy clique decompositions and greedy clique decompositions of \(K_ 4\)-free graphs (Q1340140) (← links)
- Greedy maximum-clique decompositions (Q1340141) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Greedy clique decompositions and the Turán numbers (Q1896337) (← links)
- Eigenvalues and clique partitions of graphs (Q2040995) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- On clique coverings of complete multipartite graphs (Q2309546) (← links)
- A bound on the total size of a cut cover (Q2484376) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- Sharp bounds for decomposing graphs into edges and triangles (Q4993262) (← links)
- Decomposing Graphs into Edges and Triangles (Q5222546) (← links)
- On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5915816) (← links)
- On the number of edge-disjoint triangles in \(K_4\)-free graphs (Q5970289) (← links)
