2019/02/22 by Csilla Bujtás, Bujtás, Csilla, Stanislav Jendrol′ +5 · 1 citation
Computer Science · Mathematics · #05C70 05C07 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications #math.CO #msc:05C07 #msc:05C70
paper · pdf · doi:10.48550/arxiv.1902.08689
The second part of the earlier version will be published separately
openalex publication_date 2019/02/22 · arxiv created 2020/04/27 · arxiv updated 2020/04/29 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is well known that if G = (V, E) is a multigraph and X⊂ V is a subset of even order, then G contains a spanning forest H such that each vertex from X has an odd degree in H and all the other vertices have an even degree in H. This spanning forest may have isolated vertices. If this is not allowed in H, then the situation is much more complicated. In this paper, we study this problem and generalize the concepts of even-factors and odd-factors in a unified form.