• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Diagonal Chromatic Number of Maximal Planar Graphs of Diameter Three with Twelve Vertices

Diagonal Chromatic Number of Maximal Planar Graphs of Diameter Three with Twelve Vertices

Hardcover

General Mathematics

ISBN10: 1716956307
ISBN13: 9781716956300
Publisher: Lulu Pr
Published: May 7 2020
Pages: 50
Weight: 0.92
Height: 0.25 Width: 8.50 Depth: 11.00
Language: English
This thesis is an exploration of the diagonal chromatic number of maximal planar graphs of diameter less than four. A maximal planar graph is a graph that consists of vertices and edges such that no new edge can be added without intersecting another edge. This thesis will aim to show that if a graph is maximal planar of diameter less than four with twelve vertices, then the diagonal chromatic number of the graph is six.

Also in

General Mathematics