Skip to main navigation Skip to Content

IPM

  • Director's Message
  • About IPM
  • The Constitution of IPM
  • Contact US
  • فارسي
  • Home
  • People
    • Administrative Board
    • Senior Fellows of IPM
    • Scientific Council of IPM
    • Academic Staff
  • Schools
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano Science
    • Particles and Accelerators
    • Philosophy
    • Physics
  • Centers and Units
    • Grid Computing Group
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center
  • Publications
    • Akhbar
    • Papers
    • Books
  • Bulletin Board
    • New Bulletins
    • Archive 2012
    • Archive 2011
  • Calendar
  • E - Catalog















Home
  • “ Schools ”

    IPM
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano-Science
    • Particles and Accelerators
    • Philosophy
    • Physics

    “ Centers and Units ”

    IPM
    • GCG Computing Group
    • Information Center
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center

    “ Research Groups ”

    IPM
    • Bioinformatics
    • Combinatorics and Computing
    • Commutative Algebra
    • Logic
    • IPM HPC Laboratory

    “ Useful Links ”

    IPM
    • Gallery of Visitors
    • Contact Us
    • Gallery of Photos

    “ E-Services ”

    IPM
    • Webmail
    • Official Automation System
    • Library
    • Telephone Book
  • “ Bulletin Board ”

    School of Mathematics  School of Mathematics
    Lecture
     
     
    The Discharging Method in Practice

    Mohammad R. Salavatipour,
    University of Alberta



    Abstract

    The Discharging Method is perhaps the most commonly used tool in solving graph problems on planar graph. This is the tool by which the Four Color Problem was solved after more than a century. Since then, this technique has been applied to solve several other problems on planar graphs and, although the proof of the Four Color Theorem still relies on computer, most of these proofs are hand-checkable. In this talk, we demonstrate the power of this technique by applying it to two coloring problems on planar graphs.



    Information:

    Date:Wednesday, Jan. 18, 2006, 14:00-15:00
    Place: Niavaran Bldg., Niavaran Square, Tehran, Iran

     
     
    back to top
footer
  • -IPM
  • -20 Years
  • -INO
  • -ILSF
  • -GCG
  • -Iranet
  • -LIBRARY
  • -NIC
  • -BIO
  • -CCG
  • -Logic
prev next

Exploring IPM

  • People
    • Administrative Board
    • Senior Fellows of IPM
    • Scientific Council of IPM
    • Academic Staff
  • Schools
    • Astronomy
    • Cognitive Sciences
    • Computer Science
    • Mathematics
    • Nano Science
    • Particles and Accelerators
    • Philosophy
    • Physics
  • Centers
    • Deputy for Research
    • Grid Computing Group
    • Information Center
    • Iranian Light Source Facility
    • Iranian National Observatory
    • IRNIC
    • Library
    • Network Center
  • Groups
    • Bioinformatics
    • Combinatorics and Computing
    • Logic
    • Commutative Algebra
    • IPM HPC Laboratory
  • E-Services
    • Library Catalog
    • Official Automation System
    • Official Automation System (dabir)
    • Telephone Book
    • Webmail
  • Publications
    • Akhbar
    • Papers
    • Books

 COPYRIGHT 2012 © ALL RIGHTS RESERVED

Please submit your comments or questions here, or contact Webmaster  |  ipmic@ipm.ir