Partitioning the vertices of a torus into isomorphic subgraphs
Let H be an induced subgraph of the torus Ckm. We show that when k≥3 is even and |V(H)| divides some power of k, then for sufficiently large n the torus Ckn has a perfect vertex-packing with induced copies of H. On the other hand, disproving a conjecture of Gruslys, we show that when k is...
Prif Awduron: | Bonamy, M, Morrison, N, Scott, A |
---|---|
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Elsevier
2020
|
Eitemau Tebyg
-
On the First-Order Complexity of Induced Subgraph Isomorphism
gan: Oleg Verbitsky, et al.
Cyhoeddwyd: (2019-03-01) -
An Efficient Subgraph Isomorphism Solver for Large Graphs
gan: Zubair Ali Ansari, et al.
Cyhoeddwyd: (2021-01-01) -
SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM
gan: Uroš Čibej, et al.
Cyhoeddwyd: (2019-01-01) -
Criminal Community Detection Based on Isomorphic Subgraph Analytics
gan: Sangkaran Theyvaa, et al.
Cyhoeddwyd: (2020-07-01) -
Partitioning Harary graphs into connected subgraphs containing prescribed vertices
gan: Olivier Baudon, et al.
Cyhoeddwyd: (2014-12-01)