Isolated toughness and path-factor uniform graphs

DOI10.1051/RO/2021061zbMath1468.05243OpenAlexW3153213849MaRDI QIDQ5001395

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

Publication date: 19 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2021061

zbMATH Keywords

path-factoredge-connectivityisolated toughnesspath-factor uniform graph

Mathematics Subject Classification ID

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

Related Items (10)

Component factors and binding number conditions in graphs ⋮ On path-factor critical deleted (or covered) graphs ⋮ Path factors in subgraphs ⋮ 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 ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ A result on fractional \((a,b,k)\)-critical covered graphs ⋮ Nash-Williams conditions for the existence of all fractional \([a,b\)-factors] ⋮ A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs ⋮ TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS

This page was built for publication: Isolated toughness and path-factor uniform graphs