Skip to main content
SpringerLink
Log in

Every Planar Graph with Maximum Degree 7 Is of Class 1

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract. 

V.G. Vizing conjectured in 1968 that every planar graph with maximum degree 6 or 7 is of class 1. This paper shows that, for planar graphs with maximum degree 7, Vizing's conjecture is true.

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. Department of Applied Mathematics, Information Engineering Institute, P.O. Box 1001-46, Zhengzhou Henan 450002, The People's Republic of China, , , , , , CN

    Limin Zhang

Authors
  1. Limin Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Revised: November 24, 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zhang, L. Every Planar Graph with Maximum Degree 7 Is of Class 1. Graphs Comb 16, 467–495 (2000). https://doi.org/10.1007/s003730070009

Download citation

  • Issue Date:

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

Keywords

Search

Navigation