Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each | Zendy

Tay-Woei Shyu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each

Author(s) -

Tay-Woei Shyu

Publication year - 2019

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.2197

Subject(s) - mathematics , combinatorics , bipartite graph , complete bipartite graph , stars , cograph , 1 planar graph , indifference graph , chordal graph , discrete mathematics , graph , astrophysics , physics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research