Treffer: On the adjacency matrix and the colouring of graphs
Title:
On the adjacency matrix and the colouring of graphs
Authors:
Publisher Information:
Utilitas Mathematica Pub
Publication Year:
2001
Collection:
University of Malta: OAR@UM / L-Università ta' Malta
Subject Terms:
Document Type:
Konferenz
conference object
Language:
English
Rights:
info:eu-repo/semantics/restrictedAccess ; The copyright of this work belongs to the author(s)/publisher. The rights of this work are as defined by the appropriate Copyright Legislation or as modified by any successive legislation. Users may access this work and can make use of the information contained in accordance with the Copyright Legislation provided that the author must be properly acknowledged. Further distribution or reproduction in any format is prohibited without the prior permission of the copyright holder.
Accession Number:
edsbas.FA506D5E
Database:
BASE
Weitere Informationen
A planar graph, G, can be drawn on a plane in such a way that no two edges intersect. It is said to be maximal planar if no edge can be added without losing planarity. Each vertex of an Eulerian graph is of even degree. We show that the chromatic number of a maximal planar graph is 3 if and only if it is Eulerian. From the adjacency matrix of a planar graph, the monochromatic classes can be deduced and unique colourability determined. Moreover, we show that certain transformations on a graph G determine the chromatic number x(G). ; peer-reviewed