Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
type: Item
instance of: scholarly article
title: Toughness and isolated toughness conditions for \(P_{\ge 3}\)-factor uniform graphs
zbMATH Open document ID: 1475.05097
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 7435239
zbMATH Keywords: path factor
zbMATH Keywords: \(P_{\geq 3}\)-factor uniform graph
zbMATH Keywords: toughness
zbMATH Keywords: isolated toughness
author: Hongbo Hua
MaRDI profile type: Publication
full work available at URL: s12190-020-01462-0
OpenAlex ID: W3104438296
cites work: Q3910557
cites work: Q5184946
cites work: Partitioning vertices of 1-tough graphs into paths
cites work: Tough graphs and Hamiltonian circuits.
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: Fractional \((g,f)\)-factors in graphs
cites work: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs
cites work: The existence of \(P_{\geq3}\)-factor covered graphs
cites work: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs
DOI: 10.1007/S12190-020-01462-0
description: scientific article; zbMATH DE number 7435239