Skip to main content
SpringerLink
Log in

Cyclic Degrees of 3-Polytopes

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, 630090, Russia, , , , , , RU

    Oleg V. Borodin

  2.  School of Mathematical Sciences, University of Nottingham, Nottingham, NG7 2RD, UK. e-mail: drw@maths.nott.ac.uk, , , , , , GB

    Douglas R. Woodall

Authors
  1. Oleg V. Borodin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Douglas R. Woodall
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: August 18, 1997 Revised: August 24, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Borodin, O., Woodall, D. Cyclic Degrees of 3-Polytopes. Graphs Comb 15, 267–277 (1999). https://doi.org/10.1007/s003730050060

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s003730050060

Keywords

Search

Navigation