Multiple minimum coverings of Kn with copies of K4 - e

Authors

  • Lindner C.C.
  • Penfold Street, Anne

Abstract

This paper is the last of a trilogy completely solving the maximum packing and minimum covering problems for the complete graph on n vertices, Kn, with copies of K4-e, that is, the complete graph on four vertices with one edge missing.

Published

1997-06-09

How to Cite

Lindner C.C., & Penfold Street, Anne. (1997). Multiple minimum coverings of Kn with copies of K4 - e. Utilitas Mathematica, 52. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/37

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.