On \(P_{\geq 3}\)-factor deleted graphs
type: Item
instance of: scholarly article
title: On \(P_{\geq 3}\)-factor deleted graphs
zbMATH Open document ID: 1484.05172
author: Zhiren Sun
author: Hongxia Liu
author: Sizhong Zhou
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 7490427
zbMATH Keywords: toughness
zbMATH Keywords: isolated toughness
zbMATH Keywords: connectivity
zbMATH Keywords: \(P_{\geq 3}\)-factor
zbMATH Keywords: \(P_{\geq 3}\)-factor deleted graph
MaRDI profile type: Publication
full work available at URL: s10255-022-1053-0
OpenAlex ID: W4210761405
cites work: Partitioning vertices of 1-tough graphs into paths
cites work: Q5422499
cites work: A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs
cites work: Tough graphs and Hamiltonian circuits.
cites work: Toughness and the existence of \(k\)-factors. III
cites work: Tight toughness condition for fractional \((g,f,n)\)-critical graphs
cites work: Toughness and fractional critical deleted graph
cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
cites work: Packing paths of length at least two
cites work: Q4808027
cites work: Graph factors and factorization: 1985--2003: a survey
cites work: Isolated toughness and \(k\)-Hamiltonian \([a,b]\)-factors
cites work: On k-orthogonal factorizations in networks
cites work: Research on fractional critical covered graphs
cites work: Characterization of forbidden subgraphs for the existence of even factors in a graph
cites work: Fractional \((g,f)\)-factors in graphs
cites work: A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
cites work: A result on fractional \((a,b,k)\)-critical covered graphs
cites work: Binding numbers and restricted fractional \(( g , f )\)-factors in graphs
cites work: Remarks on path factors in graphs
cites work: Path factors in subgraphs
cites work: A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs
cites work: A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs
cites work: Component factors and binding number conditions in graphs
cites work: Subgraphs with orthogonal factorizations in graphs
DOI: 10.1007/S10255-022-1053-0
description: scientific article; zbMATH DE number 7490427