Blueprint for a classic proof of the 4 colour theorem
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Patrick Labarque (2010)
Visual Mathematics
Similarity:
Wegner, Bernd (1995)
Mathematica Pannonica
Similarity:
Bouttier, J., Di Francesco, P., Guitter, E. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Siniša Vrećica (2005)
The Teaching of Mathematics
Similarity:
Heinz-Jürgen Voss (1997)
Mathematica Slovaca
Similarity:
Gillispie, Steven B., Grünbaum, Branko (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Jones, Gareth A., Pinto, Daniel (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dawson, Robert J. MacG., Doyle, Blair (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Markov, Minko (2008)
Serdica Journal of Computing
Similarity:
We investigate the NP-complete problem Vertex Separation (VS) on Maximal Outerplanar Graphs (mops). We formulate and prove a “main theorem for mops”, a necessary and sufficient condition for the vertex separation of a mop being k. The main theorem reduces the vertex separation of mops to a special kind of stretchability, one that we call affixability, of submops.