Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Planar Graphs
 
Edited by: William T. Trotter
A co-publication of the AMS and DIMACS
Planar Graphs
eBook ISBN:  978-1-4704-3967-5
Product Code:  DIMACS/9.E
List Price: $57.00
MAA Member Price: $51.30
AMS Member Price: $45.60
Planar Graphs
Click above image for expanded view
Planar Graphs
Edited by: William T. Trotter
A co-publication of the AMS and DIMACS
eBook ISBN:  978-1-4704-3967-5
Product Code:  DIMACS/9.E
List Price: $57.00
MAA Member Price: $51.30
AMS Member Price: $45.60
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 91993; 152 pp
    MSC: Primary 05

    This book contains research articles and extended abstracts submitted by participants in the Planar Graphs Workshop held at DIMACS in November 1991, one of four workshops held during the DIMACS Special Year on Graph Theory and Algorithms. With more than seventy participants, the workshop drew many of the top experts in this area. The book covers a wide range of topics, including enumeration, characterization problems, algorithms, extremal problems, and network flows and geometry.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Research mathematicians.

  • Table of Contents
     
     
    • Chapters
    • Cycles, cocycles, and diagonals: a characteriation of planar graphs
    • Stack and queue layouts of directed acyclic graphs
    • Enumeration of degree restricted maps on the sphere
    • A generalisation of MacLane’s theorem to 3-graphs
    • Chordal completions of grids and planar graphs
    • Upward planar drawing of single source acyclic digraphs
    • Flow in planar graphs: a survey of results
    • Planar graph coloring with an uncooperative partner
    • Partitioning a rectangle into many sub-rectangles so that a line can meet only a few
    • Disjoint essential circuits in toroidal maps
    • Layout of rooted trees
    • Vertex degrees in planar graphs
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 91993; 152 pp
MSC: Primary 05

This book contains research articles and extended abstracts submitted by participants in the Planar Graphs Workshop held at DIMACS in November 1991, one of four workshops held during the DIMACS Special Year on Graph Theory and Algorithms. With more than seventy participants, the workshop drew many of the top experts in this area. The book covers a wide range of topics, including enumeration, characterization problems, algorithms, extremal problems, and network flows and geometry.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Research mathematicians.

  • Chapters
  • Cycles, cocycles, and diagonals: a characteriation of planar graphs
  • Stack and queue layouts of directed acyclic graphs
  • Enumeration of degree restricted maps on the sphere
  • A generalisation of MacLane’s theorem to 3-graphs
  • Chordal completions of grids and planar graphs
  • Upward planar drawing of single source acyclic digraphs
  • Flow in planar graphs: a survey of results
  • Planar graph coloring with an uncooperative partner
  • Partitioning a rectangle into many sub-rectangles so that a line can meet only a few
  • Disjoint essential circuits in toroidal maps
  • Layout of rooted trees
  • Vertex degrees in planar graphs
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.