Minimum complementary P3-coverings of Kv

Authors

  • Rees R.
  • Shalaby N.
  • Yin J.

Abstract

In [2] Granville, Moisiadis and Rees solved the problem of complementary decomposition of Kv into P3s (paths of length three). In this paper we generalize their work by considering complementary P3-coverings of Kv. In particular, we show that a minimum complementary P3-covering of Kv with ⌈v/4 ⌈2(v-1)/3⌉⌉ P3s exist for all integers v ≥ 4, except possibly for v ∈ {23, 26, 35, 38, 41, 44, 47}.

Published

2001-06-09

How to Cite

Rees R., Shalaby N., & Yin J. (2001). Minimum complementary P3-coverings of Kv. Utilitas Mathematica, 60. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/203

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.