Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Olesy N. Kazak"'
Publikováno v:
Discrete Mathematics. 342:2439-2444
In 1940, Lebesgue proved that every 3-polytope with minimum degree 5 contains a 5-vertex for which the set of degrees of its neighbors is majorized by one of the following sequences: ( 6 , 6 , 7 , 7 , 7 ) , ( 6 , 6 , 6 , 7 , 9 ) , ( 6 , 6 , 6 , 6 , 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::78c3d6aa9d449bd9a0925f175bbb7851
https://doi.org/10.1016/j.disc.2019.05.010
https://doi.org/10.1016/j.disc.2019.05.010
Publikováno v:
Discrete Mathematics. 341:825-829
Given a 3-polytope P , by h ( P ) we denote the minimum of the maximum degrees (height) of the neighborhoods of 5-vertices (minor 5-stars) in P . In 1940, H. Lebesgue gave an approximate description of the neighborhoods of 5-vertices in the class P 5
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4f507886ddfc4d7815e4bc3e34530146
https://doi.org/10.1016/j.disc.2017.11.021
https://doi.org/10.1016/j.disc.2017.11.021
Autor:
Anna O. Ivanova, Oleg V. Borodin, D. V. Nikiforov, Tsyndyma Chimit-Dordjievna Batueva, Mikhail A. Bykov, Olesy N. Kazak
Publikováno v:
Discrete Mathematics. 340:2659-2664
The weight w ( e ) of an edge e in a normal plane map (NPM) is the degree-sum of its end-vertices. An edge e = u v is of type ( i , j ) if d ( u ) ≤ i and d ( v ) ≤ j . In 1940, Lebesgue proved that every NPM has an edge of one of the types ( 3 ,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c8a49bddb4a1a880ff3c06c6d9312f9f
https://doi.org/10.1016/j.disc.2016.10.007
https://doi.org/10.1016/j.disc.2016.10.007