A note to maximum packings of Kv with a graph G of five vertices and five edges

Authors

  • Milici, Salvatore

Abstract

In this paper we give a complete solution of the maximum packing problem for Kv with copies of a graph G having at least one vertex of degree one and such that E(G) = V(G) = 5, for all v ≥ 7 and for all possible leaves.

Published

2005-06-09

How to Cite

Milici, Salvatore. (2005). A note to maximum packings of Kv with a graph G of five vertices and five edges. Utilitas Mathematica, 68. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/362

Issue

Vol. 68 (2005): Volume 68, 2005

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.