Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8

Borodin O. V.; Ivanova A. O.; Kazak O. N.

首页> 外文期刊>Discrete mathematics >Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8

【24h】

Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8

机译：在具有最小5度的3多个顶点中描述5个顶点的邻域，并且没有6到8的度的顶点

获取原文

获取原文并翻译 | 示例

获取外文期刊封面封底 >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

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:

机译：1940年，Lebesgue证明，每个带有最小度5度的3多托含有5个顶点，其中其邻居的一组阶段主要是以下序列的主要：

著录项

来源
《Discrete mathematics》 |2019年第8期|共6页
作者
Borodin O. V.; Ivanova A. O.; Kazak O. N.;
展开▼
作者单位

Sobolev Inst Math Novosibirsk 630090 Russia;

Sobolev Inst Math Novosibirsk 630090 Russia;

Sobolev Inst Math Novosibirsk 630090 Russia;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
Planar graph; Structural properties; 3-polytope; 5-star; Neighborhood;

机译：平面图;结构性;3-多托;5星;邻里;

相似文献

外文文献
中文文献
专利

1. Describing Neighborhoods of 5-Vertices in 3-Polytopes with Minimum Degree 5 and Without Vertices of Degrees from 7 to 11 [J] . Oleg V. Borodin, Anna O. Ivanova, Olesya N. Kazak Discussiones Mathematicae Graph Theory . 2018,第3期

机译：描述最小度为5且无度顶点为7到11的3多边形中5顶点的邻域
2. Describing Neighborhoods of 5-Vertices in a Class of 3-Polytopes with Minimum Degree 5 [J] . Borodin O. V., Ivanova A. O., Nikiforov D. V. Siberian Mathematical Journal . 2018,第1期

机译：在最低5度的一类3多个网上描述5个顶点的社区
3. Low 5-Stars at 5-Vertices in 3-Polytopes with Minimum Degree 5 and No Vertices of Degree from 7 to 9 [J] . Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova Discussiones Mathematicae Graph Theory . 2020,第4期

机译：在3多个顶点的低5星，3多个顶点，最小5度，没有7到9度的顶点
4. Minimum Augmentation to Bi-Connect Specified Vertices of a Graph with Upper Bounds on Vertex-Degree [C] . Toshiya Mashima, Takanori Fukuoka, Satoshi Taoka, IEEE International Symposium on Circuits and Systems . 2005

机译：最小增强到Bi-Connect的指定顶点，顶点顶面值为顶点
5. Finding a maximum clique of a chordal graph by removing vertices of minimum degree [D] . Bhaduri, Sudipta 2008

机译：通过删除最小度数的顶点来找到弦图的最大集团
6. High-flexion TKA in patients with a minimum of 120 degrees of pre-operative knee flexion: outcomes at six years of follow-up [O] . Aree Tanavalee, Srihatach Ngarmukos, Saran Tantavisut, 2011

机译：术前膝关节屈曲最少120度的患者的高屈曲性TKA：随访6年的结果
7. Approximating the minimum triangulation of convex 3-polytopes with bounded degrees [O] . Fung, SPY, Poon, CK, Chin, FYL 2005

机译：近似具有有界度的凸3多面体的最小三角剖分

Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8

摘要

著录项

相似文献

相关主题

期刊订阅