Cyclic Degrees of 3-Polytopes

详细信息    查看全文

• 作者：Oleg V. Borodin and Douglas R. Woodall
• 刊名：Graphs and Combinatorics
• 出版年：1999
• 出版时间：September 1999
• 年：1999
• 卷：15
• 期：3
• 页码：267-277
• 全文大小：105 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Combinatorics
  Engineering Design
  
• 出版者：Springer Japan
• ISSN：1435-5914

文摘

 A precise upper bound is obtained for the minimum cyclic vertex degree in a 3-polytope with specified maximum face size. This implies improvements to some known upper bounds for the cyclic chromatic numbers of 3-polytopes.