The existence of a path-factor without small odd paths

zbMath1391.05204MaRDI QIDQ1753005

Yoshimi Egawa, Michitaka Furuya

Publication date: 25 May 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i1p40

zbMATH Keywords

matchingpath-factorcomponent-factor

Mathematics Subject Classification ID

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

Related Items (5)

Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles ⋮ Path factors in subgraphs ⋮ Isolated toughness and path-factor uniform graphs. II. ⋮ Degree conditions for the existence of a {P₂, P₅}-factor in a graph ⋮ Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient subgraphs packing
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Path and cycle factors of cubic bipartite graphs
• Path factors in cubic graphs
• Sufficient conditions for the existence of a path‐factor which are related to odd components
• Path-factors involving paths of order seven and nine

This page was built for publication: The existence of a path-factor without small odd paths