Bujtás, Csilla and Jendrol, Stanislav and Tuza, Zsolt (2020) On Specific Factors in Graphs. GRAPHS AND COMBINATORICS, 36 (5). pp. 1391-1399. ISSN 0911-0119
|
Text
Bujtas2020_Article_OnSpecificFactorsInGraphs.pdf Download (258kB) | Preview |
Official URL: https://doi.org/10.1007/s00373-020-02225-1
Abstract
It is well known that if G=(V,E) is a connected multigraph and X subset of 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.
| Item Type: | Article |
|---|---|
| Additional Information: | Funding Agency and Grant Number: Slovenian Research AgencySlovenian Research Agency - Slovenia [N1-0108]; Slovak Research and Development AgencySlovak Research and Development Agency [APVV-19-0153]; National Research, Development and Innovation Office - NKFIH [SNN 129364] Funding text: The first author acknowledges the financial support from the Slovenian Research Agency under the project N1-0108. This work of the second author was supported by the Slovak Research and Development Agency under the Contract No. APVV-19-0153. Research of the third author was supported in part by the National Research, Development and Innovation Office - NKFIH under the grant SNN 129364. The authors would like to thank Julius Czap for his helpful comments. |
| Uncontrolled Keywords: | Parity factor; spanning subgraph; Positive factor; |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 23 Sep 2020 09:53 |
| Last Modified: | 23 Sep 2020 09:53 |
| URI: | http://real.mtak.hu/id/eprint/114194 |
Actions (login required)
 |
Edit Item |
