On light subgraphs in plane graphs of minimum degree five
Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 2, pp. 207-217
Voir la notice de l'article provenant de la source Library of Science
A subgraph of a plane graph is light if the sum of the degrees of the vertices of the subgraph in the graph is small. It is well known that a plane graph of minimum degree five contains light edges and light triangles. In this paper we show that every plane graph of minimum degree five contains also light stars K_1,3 and K_1,4 and a light 4-path P₄. The results obtained for K_1,3 and P₄ are best possible.
Keywords:
planar graph, light subgraph, star, triangulation
@article{DMGT_1996_16_2_a10,
author = {Jendrol', Stanislav and Madaras, Tom\'a\v{s}},
title = {On light subgraphs in plane graphs of minimum degree five},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {207--217},
publisher = {mathdoc},
volume = {16},
number = {2},
year = {1996},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a10/}
}
TY - JOUR AU - Jendrol', Stanislav AU - Madaras, Tomáš TI - On light subgraphs in plane graphs of minimum degree five JO - Discussiones Mathematicae. Graph Theory PY - 1996 SP - 207 EP - 217 VL - 16 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a10/ LA - en ID - DMGT_1996_16_2_a10 ER -
Jendrol', Stanislav; Madaras, Tomáš. On light subgraphs in plane graphs of minimum degree five. Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 2, pp. 207-217. http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a10/