Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor

DOI10.1155/2023/9932025zbMath1516.05204OpenAlexW4367059750MaRDI QIDQ6099108

Haci Mehmet Baskonus, Jian-Zhang Wu, Jiabin Yuan, Wei Gao

Publication date: 19 June 2023

Published in: Journal of Function Spaces (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2023/9932025

zbMATH Keywords

network graphsfactor-deleted graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered 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
• Packing paths of length at least two
• The extension degree conditions for fractional factor
• On \(P_{\geq 3}\)-factor deleted graphs
• On path-factor critical deleted (or covered) graphs
• The existence of \(P_{\geq3}\)-factor covered graphs
• Tough graphs and Hamiltonian circuits.
• Toughness and the existence ofk-factors
• Isolated toughness and path-factor uniform graphs
• Isolated toughness for path factors in networks
• The binding number of a graph and its Anderson number
• Toughness condition for a graph to be all fractional (g,f,n)-critical deleted
• TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS IN GRAPHS
• Path factors and neighborhoods of independent sets in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor