On path factors of (3,4)-biregular bigraphs

Simple item page
dc.creatorAsratian, Armen S.
dc.creatorCasselgren, Carl Johan
dc.date2007-06-12
dc.date.accessioned2026-07-07T08:05:20Z
dc.date.available2026-07-07T08:05:20Z
dc.descriptionA (3,4)-biregular bigraph G is a bipartite graph where all vertices in one part have degree 3 and all vertices in the other part have degree 4. A path factor of G is a spanning subgraph whose components are nontrivial paths. We prove that a simple (3,4)-biregular bigraph always has a path factor such that the endpoints of each path have degree three. Moreover we suggest a polynomial algorithm for the construction of such a path factor.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/0706.1740
dc.identifierhttp://arxiv.org/abs/0706.1740
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130250
dc.subjectCombinatorics
dc.subject05C15, 05C70
dc.titleOn path factors of (3,4)-biregular bigraphs
dc.typetext

Files

Collections

arXiv