Path-factors involving paths of order seven and nine

DOI10.20429/TAG.2016.030105MaRDI QIDQ5225522zbMATH OpenOpenAlexFDO

Authors Yoshimi Egawa, Michitaka Furuya

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

matchingcomplete graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Abstract: In this paper, we show the following two theorems (here $c_i(G-X)$ is the number of components $C$ of $G-X$ with $|V(C)|=i$): (i)~If a graph $G$ satisfies $c_1(G-X)+frac13c_3(G-X)+frac13c_5(G-X)leqfrac23|X|$ for all $XsubseteqV(G)$, then $G$ has a $P_2,P_7$-factor. (ii)~If a graph $G$ satisfies $c_1(G-X)+c_3(G-X)+frac23c_5(G-X)+frac13c_7(G-X)leqfrac23|X|$ for all $XsubseteqV(G)$, then $G$ has a $P_2,P_9$-factor.

Recommendations

• scientific article; zbMATH DE number 3893247
• Remarks on path factors in graphs
• Path-factors in the square of a tree
• Path factors in subgraphs
• Path factors of bipartite graphs
• The units of cyclic groups of orders 7 and 9
• Rainbow and orthogonal paths in factorizations of \(K_n\)
• \(P_9\)-factorization of complete bipartite graph
• Path factorizations of complete multipartite graphs
• Identities for self-conjugate 7- and 9-core partitions

Cited in

(3)

• The existence of a path-factor without small odd paths
• 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

This page was built for publication: Path-factors involving paths of order seven and nine

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