Decomposition of complete graphs into bi-cyclic graphs with eight edges

Dalibor Froncek; Jehyun Lee

Decomposition of complete graphs into bi-cyclic graphs with eight edges

Dalibor Froncek, Jehyun Lee

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph K_n whenever the necessary conditions are satisfied.

Original language	English (US)
Pages (from-to)	30-49
Number of pages	20
Journal	Bulletin of the Institute of Combinatorics and its Applications
Volume	88
State	Published - 2020

Bibliographical note

Publisher Copyright:
© 2020, BULLETIN OF THE IC. All Rights Reserved

Keywords

Graph decomposition
tripartite ᵨ-labeling

OpenUrl availability

Full text

Cite this

@article{db5304f9923540cfb8ec2e23c79c8e2d,

title = "Decomposition of complete graphs into bi-cyclic graphs with eight edges",

abstract = "We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.",

keywords = "Graph decomposition, tripartite ᵨ-labeling",

author = "Dalibor Froncek and Jehyun Lee",

year = "2020",

language = "English (US)",

volume = "88",

pages = "30--49",

journal = "Bulletin of the Institute of Combinatorics and its Applications",

issn = "1183-1278",

publisher = "Institute of Combinatorics and its Applications",

}

TY - JOUR

T1 - Decomposition of complete graphs into bi-cyclic graphs with eight edges

AU - Froncek, Dalibor

AU - Lee, Jehyun

PY - 2020

Y1 - 2020

N2 - We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

AB - We show that each of the 35 non-isomorphic bi-cyclic graphs with eight edges decomposes the complete graph Kn whenever the necessary conditions are satisfied.

KW - Graph decomposition

KW - tripartite ᵨ-labeling

UR - http://www.scopus.com/inward/record.url?scp=85100439068&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85100439068&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85100439068

SN - 1183-1278

VL - 88

SP - 30

EP - 49

JO - Bulletin of the Institute of Combinatorics and its Applications

JF - Bulletin of the Institute of Combinatorics and its Applications

ER -

Decomposition of complete graphs into bi-cyclic graphs with eight edges

Abstract

Bibliographical note

Keywords

OpenUrl availability

Other files and links

Fingerprint

Cite this