Edge Colorings of Embedded Graphs | Graphs and Combinatorics Skip to main content
Springer Nature Link
Log in

Edge Colorings of Embedded Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract.

 In his paper, we discuss under what conditions graphs embedded in a surface Σ will be class one.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1.  Department of Mathematics, Southern University, Baton Rouge, LA 70813, USA, , , , , , US

    Zhongde Yan

  2.  Department of Mathematics, Tulane University New Orleans, LA 70118, USA e-mail: nzhao@ultral.math.tulane.edu, , , , , , US

    Yue Zhao

Authors
  1. Zhongde Yan
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yue Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: August 14, 1997 Revised: April 15, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yan, Z., Zhao, Y. Edge Colorings of Embedded Graphs. Graphs Comb 16, 245–256 (2000). https://doi.org/10.1007/s003730070027

Download citation

  • Issue Date:

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

Keywords