Vertex-disjoint copies of K¯₄
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 249-262
Voir la notice de l'article provenant de la source Library of Science
Let G be a graph of order n. Let K¯ₗ be the graph obtained from Kₗ by removing one edge.
Keywords:
extremal graph theory, vertex disjoint copy, minimum degree
@article{DMGT_2004_24_2_a7,
author = {Kawarabayashi, Ken-ichi},
title = {Vertex-disjoint copies of {K{\textasciimacron}₄}},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {249--262},
publisher = {mathdoc},
volume = {24},
number = {2},
year = {2004},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a7/}
}
Kawarabayashi, Ken-ichi. Vertex-disjoint copies of K¯₄. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 2, pp. 249-262. http://geodesic.mathdoc.fr/item/DMGT_2004_24_2_a7/