English

Minor stars in plane graphs with minimum degree five

Combinatorics 2022-06-13 v2 Discrete Mathematics

Abstract

The weight of a subgraph HH in GG is the sum of the degrees in GG of vertices of HH. The {\em height} of a subgraph HH in GG is the maximum degree of vertices of HH in GG. A star in a given graph is minor if its center has degree at most five in the given graph. Lebesgue (1940) gave an approximate description of minor 55-stars in the class of normal plane maps with minimum degree five. In this paper, we give two descriptions of minor 55-stars in plane graphs with minimum degree five. By these descriptions, we can extend several results and give some new results on the weight and height for some special plane graphs with minimum degree five.

Keywords

Cite

@article{arxiv.1706.02476,
  title  = {Minor stars in plane graphs with minimum degree five},
  author = {Yangfan Li and Mengjiao Rao and Tao Wang},
  journal= {arXiv preprint arXiv:1706.02476},
  year   = {2022}
}

Comments

11 pages, 3 figures

R2 v1 2026-06-22T20:12:39.549Z