Some results on path-factor critical avoidable graphs

DOI10.7151/DMGT.2364MaRDI QIDQ2107757zbMATH OpenOpenAlexFDO

Authors Sizhong Zhou

Publication date 2 December 2022

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2364

zbMATH Keywords

\((P_{ \geq k}, n)\)-factor critical avoidable graph\(P_{\geq k}\)-factorisolated toughnesstoughness

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Deterministic network models in operations research (90B10)

Recommendations

• Toughness and isolated toughness conditions for path-factor critical covered graphs
• Remarks on path factors in graphs
• Isolated toughness and \(P_{\ge 3}\)-factors in graphs
• Toughness, isolated toughness and path factors in graphs
• Isolated toughness for path factors in networks

Cites work

• 1-factor covers of regular 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
• A sufficient condition for the existence of restricted fractional (g, f)-factors in graphs
• A toughness condition for fractional \((k, m)\)-deleted graphs revisited
• A toughness condition for fractional \((k,m)\)-deleted graphs
• An extension of Tutte's 1-factor theorem
• An isolated toughness condition for graphs to be fractional (k, m)-deleted graphs
• Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
• Binding numbers for fractional \((a, b, k)\)-critical covered graphs
• Component factors with large components in graphs
• Degree conditions for fractional \((a,b,k)\)-critical covered graphs
• Fractional (g,f)-factors in graphs
• Packing 3-vertex paths in claw-free graphs and related topics
• Remarks on orthogonal factorizations of digraphs
• Remarks on path factors in graphs
• Research on fractional critical covered graphs
• Some existence theorems on path factors with given properties in graphs
• Subgraphs with orthogonal factorizations in graphs
• Sufficient conditions for the existence of a path-factor which are related to odd components
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Toughness of graphs and the existence of factors

Cited in

(36)

• Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
• A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
• On path-factor critical deleted (or covered) graphs
• Path factors in subgraphs
• A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
• Avoidable paths in graphs
• Binding numbers and restricted fractional ( g , f )-factors in graphs
• A result on fractional \((a,b,k)\)-critical covered graphs
• Two sufficient conditions for odd \([1,b]\)-factors in graphs
• Toughness for fractional \((2, b, k)\)-critical covered graphs
• A neighborhood condition for graphs to have restricted fractional (g,f)-factors
• Some results about ID-path-factor critical graphs
• Remarks on component factors
• Path factors and neighborhoods of independent sets in graphs
• Isolated toughness and path-factor uniform graphs. II.
• Two Sufficient Conditions for Graphs to Admit Path Factors
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph
• Sufficient conditions for graphs to have strong parity factors
• \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
• The A_-spectral radius for path-factors in graphs
• Some existence theorems on path-factor critical avoidable graphs
• Spanning k-trees and distance signless Laplacian spectral radius of graphs
• Independence number and minimum degree for path-factor critical uniform graphs
• Tight toughness bounds for path-factor critical avoidable graphs
• Star-factors with large components, fractional k-extendability and spectral radius in graphs
• Characterizing spanning trees via the size or the spectral radius of graphs
• A spectral condition for component factors in graphs
• An odd \([1, b]\)-factor in a graph from signless Laplacian spectral radius
• The path-factors and generalized distance spectral radius of graphs
• A spectral condition for the existence of component factors in graphs
• A distance spectral radius for star-factors with large components in graphs
• Toughness, fractional extendability and distance spectral radius in graphs
• Spectral conditions for component factors in graphs involving minimum degree
• Two sufficient conditions for component factors in graphs
• Some spectral conditions for star-factors in bipartite graphs
• Laplacian eigenvalue condition for a graph to have the strong parity property

This page was built for publication: Some results on path-factor critical avoidable graphs

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