3 research outputs found
Minor stars in plane graphs with minimum degree five
The weight of a subgraph in is the sum of the degrees in of
vertices of . The {\em height} of a subgraph in is the maximum
degree of vertices of in . 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 -stars in the class of normal plane maps
with minimum degree five. In this paper, we give two descriptions of minor
-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.Comment: 11 pages, 3 figure
All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description of 3-stars in P5s is tight in the sense that no its parameter can be strengthened due to the dodecahedron combined with the existence of a P5 in which every 3-vertex has a 4-neighbor.
We give another tight description of 3-stars in P5s: there is a vertex of degree at most 4 having three 3-neighbors. Furthermore, we show that there are only these two tight descriptions of 3-stars in P5s.
Also, we give a tight description of stars with at least three rays in P5s and pose a problem of describing all such descriptions. Finally, we prove a structural theorem about P5s that might be useful in further research
All Tight Descriptions of 3-Stars in 3-Polytopes with Girth 5
Lebesgue (1940) proved that every 3-polytope P5 of girth 5 has a path of three vertices of degree 3. Madaras (2004) refined this by showing that every P5 has a 3-vertex with two 3-neighbors and the third neighbor of degree at most 4. This description of 3-stars in P5s is tight in the sense that no its parameter can be strengthened due to the dodecahedron combined with the existence of a P5 in which every 3-vertex has a 4-neighbor