On \(P_{\geq 3}\)-factor deleted graphs

DOI10.1007/s10255-022-1053-0zbMath1484.05172OpenAlexW4210761405MaRDI QIDQ2115230

Zhi-ren Sun, Hongxia Liu, Si-zhong Zhou

Publication date: 15 March 2022

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-022-1053-0

zbMATH Keywords

connectivitytoughnessisolated toughness\(P_{\geq 3}\)-factor\(P_{\geq 3}\)-factor deleted graph

Mathematics Subject Classification ID

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

Related Items (8)

Discussion on fractional \((a, b, k)\)-critical covered graphs ⋮ Discussions on orthogonal factorizations in digraphs ⋮ An existence theorem on fractional ID-(g, f)-factor-critical covered graphs ⋮ Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor ⋮ Path factors and neighborhoods of independent sets in graphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Two sufficient conditions for odd \([1,b\)-factors in graphs] ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph factors and factorization: 1985--2003: a survey
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Toughness and the existence of \(k\)-factors. III
• Packing paths of length at least two
• Isolated toughness and \(k\)-Hamiltonian \([a,b\)-factors]
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• Component factors and binding number conditions in graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b \)-factor-critical covered graphs]
• Subgraphs with orthogonal factorizations in graphs
• Research on fractional critical covered graphs
• A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
• Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
• Tough graphs and Hamiltonian circuits.
• TIGHT TOUGHNESS CONDITION FOR FRACTIONAL (g, f, n)-CRITICAL GRAPHS
• Remarks on path factors in graphs
• On k-orthogonal factorizations in networks
• Partitioning vertices of 1-tough graphs into paths

This page was built for publication: On \(P_{\geq 3}\)-factor deleted graphs