Maximal Planar Graph with minimal degree Five construction
by explosion, diagonal operations
Rolland-Balzon Philippe
Last update 06/2002

Generator
MPG5 description
Vertices number (>14) called $n
Graphs number
Operations (Explosion is necessary by starting on 14 until $n)
Random FLIP (if n>16) Max by order
Reduce D-possibilities

Dimacs File Storage

(optional)

    Ex: (with write access...)
  • ftp://user:password@ftp.your_site.com/dir/your_prefixe
  • file://c:\\dir\\your_prefixe
  • c:\dir\your_prefixe
    • (if php/apache in localhost)

Dimacs SGBD Storage

(optional)

    Ex: IP/login/passwd@SID/table
Display
Matrix Display
Process Verbose
Display selected vertex (for explosion)
Verification (Final step)
Verification (all steps)
Dimacs Display
Number of flip by order
Computing Time
Number of vertices $x$ in Xsup6 with N(x) in Xinf6
How To 2.0.1,1.0.3
Sources mpg5_constructor-2.0.1.zip PHP, 21/06/2002 | C++

Introduction: We are looking for a new approach in order to construct all $MPG5$. Here we will give some informations about this goal.


Contacts :
http://prolland.free.fr | http://prolland.multimania.fr
prolland@free.fr | prolland@sepro-robotique.com


See :
1. http://mat.gsia.cmu.edu/COLOR/instances.html: Dimacs graphs instances