Factorization of Kn, n into (0, j)-prisms

Sylwia Cichacz, Dalibor Froncek

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

We establish a necessary and sufficient condition for the existence of a factorization of the complete bipartite graph Kn, n into some families of 3-regular graphs.

Original languageEnglish (US)
Pages (from-to)932-934
Number of pages3
JournalInformation Processing Letters
Volume109
Issue number16
DOIs
StatePublished - Jul 31 2009

Bibliographical note

Funding Information:
✩ The work was supported by Fulbright Scholarship nr 15072441. * Corresponding author at: AGH University of Science and Technology, Al. Mickiewicza 30, 30-059 Kraków, Poland. E-mail addresses: [email protected] (S. Cichacz), [email protected] (D. Froncek).

Keywords

  • Factorization
  • Graph algorithms
  • Prism

Fingerprint

Dive into the research topics of 'Factorization of Kn, n into (0, j)-prisms'. Together they form a unique fingerprint.

Cite this