On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866913563413577728 |
|---|---|
| author | Mukhopadhyay, Asish John, Daniel Sarweh, Lucas |
| author_facet | Mukhopadhyay, Asish John, Daniel Sarweh, Lucas |
| contents | In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_18999 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors Mukhopadhyay, Asish John, Daniel Sarweh, Lucas Data Structures and Algorithms Combinatorics E.1; F.2; G.4 In this note, we consider the problem of generating $k$-factorable graphic sequences with connected (resp. no connected) $k$-factors. |
| title | On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors |
| topic | Data Structures and Algorithms Combinatorics E.1; F.2; G.4 |
| url | https://arxiv.org/abs/2410.18999 |