The existence of \(P_{\geq3}\)-factor covered graphs
From MaRDI portal
Publication:2409795
DOI10.7151/dmgt.1974zbMath1372.05178OpenAlexW2607117956MaRDI QIDQ2409795
Tao Zhang, Jian-Cheng Wu, Si-zhong Zhou
Publication date: 13 October 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1974
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Independence number, connectivity and all fractional \((a, b, k)\)-critical graphs, Path cover problems with length cost, Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor, Some existence theorems on path factors with given properties in graphs, Path cover problems with length cost, Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs, The existence of path-factor covered graphs, TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient condition for the existence of an even \([a,b\)-factor in graph]
- A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs
- Star-factors with large components
- Factors and factorizations of graphs. Proof techniques in factor theory
- Component factors with large components in graphs
- \(K_{1,3}\)-factors in graphs
- Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
- Independence number, connectivity and \((a,b,k)\)-critical graphs
- A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
- Packing paths of length at least two
- Star-like factors with large components
- Subdigraphs with orthogonal factorizations of digraphs. II
- Toughness and the existence of fractional \(k\)-factors of graphs
- Tough graphs and Hamiltonian circuits.
- Partitioning vertices of 1-tough graphs into paths