Decompositions of Complete Bipartite Graphs and Complete Graphs into Paths, Stars, and Cycles with Four Edges Each

0Citations
Citations of this article
N/AReaders
Mendeley users who have this article in their library.

Abstract

Let G be either a complete graph of odd order or a complete bipartite graph in which each vertex partition has an even number of vertices. In this paper, we determine the set of triples (p, q, r), with p, q, r > 0, for which there exists a decomposition of G into p paths, q stars, and r cycles, each of which has 4 edges.

Cite

CITATION STYLE

APA

Shyu, T. W. (2021). Decompositions of Complete Bipartite Graphs and Complete Graphs into Paths, Stars, and Cycles with Four Edges Each. Discussiones Mathematicae - Graph Theory, 41(2), 451–468. https://doi.org/10.7151/dmgt.2197

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free