Range of diameters of complementary factors of almost complete tripartite graphs

Research output: Contribution to journalArticlepeer-review

Abstract

A complete tripartite graph without one edge, K̃m1,m2,m3, is called almost complete tripartite graph. A graph that K̃m1,m2,m3 that can be decomposed into two isomorphic factors with a given diameter d is called d-halvable. We prove that K̃m1,m2,m3 is d-halvable for a finite d only if d ≤ 5.

Original languageEnglish (US)
Pages (from-to)211-225
Number of pages15
JournalUtilitas Mathematica
Volume57
StatePublished - May 1 2000

Keywords

  • Graph decompositions
  • Isomorphic factors
  • Self-complementary graphs

Fingerprint Dive into the research topics of 'Range of diameters of complementary factors of almost complete tripartite graphs'. Together they form a unique fingerprint.

Cite this