Skip to main content
SpringerLink
Log in

Edge Colorings of Embedded Graphs

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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

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

Instant access to the full article PDF.

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 in PubMed Google Scholar

  2. Yue Zhao
    View author publications

    You can also search for this author in PubMed 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

Search

Navigation