Highly Influenced

4 Excerpts

@article{Asratian2008OnPF, title={On Path Factors of (3, 4)-Biregular Bigraphs}, author={Armen S. Asratian and Carl Johan Casselgren}, journal={Graphs and Combinatorics}, year={2008}, volume={24}, pages={405-411} }

- Published in Graphs and Combinatorics 2008
DOI:10.1007/s00373-008-0803-y

A (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.