Decomposition of complete graphs into (0, 2)-prisms

Sylwia Cichacz, Soleh Dib, Dalibor Froncek

Research output: Contribution to journalArticlepeer-review

Abstract

R. Frucht and J.Gallian (1988) proved that bipartite prisms of order 2n have an α-labeling, thus they decompose the complete graph K6nx+1 for any positive integer x. We use a technique called the ρ{variant}+-labeling introduced by S. I. El-Zanati, C. Vanden Eynden, and N. Punnim (2001) to show that also some other families of 3-regular bipartite graphs of order 2n called generalized prisms decompose the complete graph K6nx+1 for any positive integer x.

Original languageEnglish (US)
Pages (from-to)37-43
Number of pages7
JournalCzechoslovak Mathematical Journal
Volume64
Issue number1
DOIs
StatePublished - Mar 2014

Keywords

  • decompositions
  • prism

Fingerprint Dive into the research topics of 'Decomposition of complete graphs into (0, 2)-prisms'. Together they form a unique fingerprint.

Cite this