Search: onr:"swepub:oai:DiVA.org:liu-16082" >
On Path Factors of ...
On Path Factors of (3,4)-Biregular Bigraphs
-
- Asratian, Armen (author)
- Linköpings universitet,Tekniska högskolan,Tillämpad matematik,Linköping University Linköping Sweden
-
- Casselgren, Carl Johan, 1982- (author)
- Umeå universitet,Institutionen för matematik och matematisk statistik,Umeå University
-
(creator_code:org_t)
- 2008-10-26
- 2008
- English.
-
In: Graphs and Combinatorics. - : Springer Science and Business Media LLC. - 0911-0119 .- 1435-5914. ; 24:5, s. 405-411
- Related links:
-
http://arxiv.org/pdf...
-
show more...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
https://urn.kb.se/re...
-
show less...
Abstract
Subject headings
Close
- 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.
Subject headings
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Keyword
- Path factor
- Biregular bigraph
- Interval edge coloring
- MATHEMATICS
- MATEMATIK
Publication and Content Type
- ref (subject category)
- art (subject category)
Find in a library
To the university's database