Sufficient conditions for the existence of a path‐factor which are related to odd components

DOI10.1002/jgt.22253zbMath1417.05163arXiv1705.08592OpenAlexW2963730318WikidataQ129974325 ScholiaQ129974325MaRDI QIDQ4646939

Michitaka Furuya, Yoshimi Egawa, Kenta Ozeki

Publication date: 3 January 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.08592

zbMATH Keywords

path-factortoughnesscomponent factor

Mathematics Subject Classification ID

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

Related Items (7)

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles ⋮ Path-factor critical covered graphs and path-factor uniform graphs ⋮ Characterizing \(\mathcal{P}_{\geqslant 2} \)-factor and \(\mathcal{P}_{\geqslant 2} \)-factor covered graphs with respect to the size or the spectral radius ⋮ The existence of a path-factor without small odd paths ⋮ The spectral radius and \({\mathcal{P}}_{\ge \ell}\)-factors of graphs involving minimum degree ⋮ The existence of path-factor covered graphs ⋮ Some results on path-factor critical avoidable graphs

This page was built for publication: Sufficient conditions for the existence of a path‐factor which are related to odd components