On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mukhopadhyay, Asish, John, Daniel, Sarweh, Lucas
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Combinatorics E.1; F.2; G.4
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2410.18999