On r-factors with components containing specified vertices in a torus
Let T be a graph obtained by taking the Cartesian product of n cycles of even lengths [Formula: see text]. It is known that for any subset of k vertices of T with [Formula: see text] there exists a 2-factor in T where each cycle contains exactly one of the k vertices. We generalize this result to r-...
Kaydedildi:
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Artigo |
| Dil: | Inglês |
| Baskı/Yayın Bilgisi: |
Taylor & Francis Group
2025-12-01
|
| Seri Bilgileri: | AKCE International Journal of Graphs and Combinatorics |
| Konular: | |
| Online Erişim: | https://www.tandfonline.com/doi/10.1080/09728600.2025.2592928 |
| Etiketler: |
Etiket eklenmemiş, İlk siz ekleyin!
|