On P_ 3-factor deleted graphs

DOI10.1007/S10255-022-1053-0MaRDI QIDQ2115230zbMATH OpenOpenAlexFDO

Authors Zhiren Sun, Hongxia Liu, Sizhong 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) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Isolated toughness and \(P_{\ge 3}\)-factors in graphs
• Remarks on path factors in graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• Path factors in subgraphs
• On path-factor critical deleted (or covered) graphs

Cites work

• scientific article; zbMATH DE number 1916884 (Why is no real title available?)
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• A neighborhood union condition for 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
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• A result on fractional \((a,b,k)\)-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
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• Component factors and binding number conditions in graphs
• Fractional \((g,f)\)-factors in graphs
• Graph factors and factorization: 1985--2003: a survey
• Graph theory
• Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
• On \(k\)-orthogonal factorizations in networks
• Packing paths of length at least two
• Partitioning vertices of 1-tough graphs into paths
• Path factors in subgraphs
• Remarks on path factors in graphs
• Research on fractional critical covered graphs
• Subgraphs with orthogonal factorizations in graphs
• Tight toughness condition for fractional \((g,f,n)\)-critical graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and fractional critical deleted graph
• Toughness and the existence of \(k\)-factors. III

Cited in

(18)

• Path factors in subgraphs
• Two Sufficient Conditions for Graphs to Admit Path Factors
• An existence theorem on fractional ID-\((g, f)\)-factor-critical covered graphs
• Discussion on fractional \((a, b, k)\)-critical covered graphs
• Discussions on orthogonal factorizations in digraphs
• Binding number and path-factor critical deleted graphs
• scientific article; zbMATH DE number 3893247 (Why is no real title available?)
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
• Path factors and neighborhoods of independent sets in graphs
• Sun toughness and \(P_{\geq3}\)-factors in graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Some results about star-factors in graphs
• Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
• Isolated toughness and \(P_{\ge 3}\)-factors in graphs
• Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
• On path-factor critical uniform graphs
• On path-factor critical deleted (or covered) graphs
• Isolated toughness and path-factor uniform graphs. II.

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

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