Independence number and minimum degree for path-factor critical uniform graphs

DOI10.1016/J.DAM.2024.07.043MaRDI QIDQ6633529

Publication date: 6 November 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Could not fetch data.

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Packing 3-vertex paths in claw-free graphs and related topics
Component factors with large components in graphs
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
Minimum degree, independence number and regular factors
A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs
Some results on path-factor critical avoidable graphs
On path-factor critical deleted (or covered) graphs
Path factors in subgraphs
Research on fractional critical covered graphs
Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs
Two sufficient conditions for odd \([1,b\)-factors in graphs]
Some sufficient conditions for path-factor uniform graphs
Path factors of bipartite graphs
Sharp conditions on fractional ID-(g, f)-factor-critical covered graphs
Isolated toughness for path factors in networks
Partitioning vertices of 1-tough graphs into paths
Path factors and neighborhoods of independent sets in graphs
Binding number and path-factor critical deleted graphs
Sun toughness and path-factor uniform graphs
Path-factor critical covered graphs and path-factor uniform graphs
\(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
The \(A_\alpha\)-spectral radius for path-factors in graphs
Distance signless Laplacian spectral radius for the existence of path-factors in graphs

This page was built for publication: Independence number and minimum degree for path-factor critical uniform graphs

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