5-Stars of Low Weight in Normal Plane Maps with Minimum Degree 5
It is known that there are normal plane maps M5 with minimum degree 5 such that the minimum degree-sum w(S5) of 5-stars at 5-vertices is arbitrarily large. In 1940, Lebesgue showed that if an M5 has no 4-stars of cyclic type (5, 6, 6, 5) centered at 5-vertices, then w(S5) ≤ 68. We improve this bound...
Main Authors: | Borodin Oleg V., Ivanova Anna O., Jensen Tommy R. |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2014-08-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.1748 |
Similar Items
-
A Note On Vertex Colorings Of Plane Graphs
by: Fabricia Igor, et al.
Published: (2014-11-01) -
On the chromatic number of graphs with some restriction of vertex degrees
by: S.N. Selezneva
Published: (2020-12-01) -
On the chromatic number of (P_{5},windmill)-free graphs
by: Ingo Schiermeyer
Published: (2017-01-01) -
On vertex and edge degree-based topological indices
by: Ivan Gutman
Published: (2023-10-01) -
Connected Tropical Subgraphs in Vertex-Colored Graphs
by: Jean-Alexandre Anglès d'Auriac, et al.
Published: (2016-08-01)