The existence of a path-factor without small odd paths

zbMATH Open1391.05204MaRDI QIDQ1753005FDOQ1753005

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Sufficient conditions for graphs with {P₂, P₅}-factors
• Sufficient conditions for the existence of a path-factor which are related to odd components
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Path-factors involving paths of order seven and nine
• Path factors of bipartite graphs

zbMATH Keywords

matchingpath-factorcomponent-factor

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Title not available (Why is that?)
• Efficient subgraphs packing
• Path factors in cubic graphs
• Path and cycle factors of cubic bipartite 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

Cited In (11)

• Some existence theorems on path factors with given properties in graphs
• Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles
• Title not available (Why is that?)
• Characterizing \(\mathcal{P}_{\geqslant 2}\)-factor deleted graphs with respect to the size or the spectral radius
• Path factors of bipartite graphs
• Characterizing spanning trees via the size or the spectral radius of graphs
• Degree conditions for path-factors in graphs
• Isolated toughness and path-factor uniform graphs. II.
• Path factors in subgraphs
• A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two
• Degree conditions for the existence of a {P₂, P₅}-factor in a graph

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

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