On specific factors in graphs

DOI10.1007/S00373-020-02225-1MaRDI QIDQ2227979zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza, Csilla Bujtás, Stanislav Jendroľ

Publication date 16 February 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1902.08689

zbMATH Keywords

parity factorpositive factorspanning subgraphstrong parity property

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: It is well known that if $G=(V,E)$} is a multigraph and $XsubsetV$ 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.

Recommendations

• Some results on odd factors of graphs
• On factors with all degrees odd
• scientific article; zbMATH DE number 842003
• Connected factors in graphs -- a survey
• Maximum even factors of graphs

Cites work

• Decompositions of highly connected graphs into paths of length 3
• Factors and factorizations of graphs. Proof techniques in factor theory
• Factors and factorizations of graphs—a survey
• General factors of graphs
• Graph factors and factorization: 1985--2003: a survey
• scientific article; zbMATH DE number 3720862 (Why is no real title available?)
• scientific article; zbMATH DE number 878892 (Why is no real title available?)
• Matching theory
• Regular graphs, regular factors, and the impact of Petersen's theorems
• Spanning trees and spanning Eulerian subgraphs with small degrees
• Spanning trees: A survey
• Subgraphs with prescribed valencies

Cited in

(12)

• A characterization for graphs having strong parity factors
• Equitable factorizations of edge-connected graphs
• On caterpillar factors in graphs
• Sufficient conditions for graphs to have strong parity factors
• Perfect integer k-matching, k-factor-critical, and the spectral radius of graphs
• A spectral condition for a graph to have strong parity factors
• Some results on the k-strong parity property in a graph
• Spectral conditions for a graph to have strong parity factors
• Modulo factors with bounded degrees
• Odd-even factors of graphs
• Sufficient conditions for the existence of path-factors with given properties
• Laplacian eigenvalue condition for a graph to have the strong parity property

This page was built for publication: On specific factors in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227979)