On Path Factors of (3,4)-Biregular Bigraphs
2008 (English)In: Graphs and Combinatorics, ISSN 0911-0119, Vol. 24, no 5, 405-411 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2008. Vol. 24, no 5, 405-411 p.
Path factor, Biregular bigraph, Interval edge coloring
IdentifiersURN: urn:nbn:se:liu:diva-16082DOI: 10.1007/s00373-008-0803-yOAI: oai:DiVA.org:liu-16082DiVA: diva2:133100