On specific factors in graphs
From MaRDI portal
Publication:2227979
DOI10.1007/s00373-020-02225-1zbMath1458.05210arXiv1902.08689OpenAlexW3080270014MaRDI QIDQ2227979
Zsolt Tuza, Stanlislav Jendroľ, Csilla Bujtás
Publication date: 16 February 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08689
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40)
Related Items
Equitable factorizations of edge-connected graphs, Sufficient conditions for graphs to have strong parity factors, On caterpillar factors in graphs, A characterization for graphs having strong parity factors
Cites Work
- Factors and factorizations of graphs. Proof techniques in factor theory
- Spanning trees: A survey
- Graph factors and factorization: 1985--2003: a survey
- General factors of graphs
- Matching theory
- Regular graphs, regular factors, and the impact of Petersen's theorems
- Spanning trees and spanning Eulerian subgraphs with small degrees
- Decompositions of highly connected graphs into paths of length 3
- Factors and factorizations of graphs—a survey
- Subgraphs with prescribed valencies
- Unnamed Item
- Unnamed Item