Path-factors involving paths of order seven and nine
From MaRDI portal
Publication:5225522
DOI10.20429/TAG.2016.030105zbMATH Open1416.05156arXiv1507.07066OpenAlexW2963527720MaRDI QIDQ5225522FDOQ5225522
Authors: Yoshimi Egawa, Michitaka Furuya
Publication date: 22 July 2019
Published in: Theory and Applications of Graphs (Search for Journal in Brave)
Abstract: In this paper, we show the following two theorems (here is the number of components of with ): (i)~If a graph satisfies for all , then has a -factor. (ii)~If a graph satisfies for all , then has a -factor.
Full work available at URL: https://arxiv.org/abs/1507.07066
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)
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)