On the adjacency matrix and the colouring of graphs

Sciriha, Irene; Marino, Corinna M.

Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/109166

Full metadata record

DC Field	Value	Language
dc.contributor.author	Sciriha, Irene	-
dc.contributor.author	Marino, Corinna M.	-
dc.date.accessioned	2023-05-05T06:22:54Z	-
dc.date.available	2023-05-05T06:22:54Z	-
dc.date.issued	2001	-
dc.identifier.citation	Sciriha, I., & Marino, M. C. (2001). On the adjacency matrix and the colouring of graphs. Proceedings of the Thirty-second Southeastern International Conference on Combinatorics, Graph Theory and Computing, Baton Rouge, Louisiana. Congressus Numerantium, 148, 43-63.	en_GB
dc.identifier.uri	https://www.um.edu.mt/library/oar/handle/123456789/109166	-
dc.description.abstract	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).	en_GB
dc.language.iso	en	en_GB
dc.publisher	Utilitas Mathematica Pub	en_GB
dc.rights	info:eu-repo/semantics/restrictedAccess	en_GB
dc.subject	Graph theory -- Data processing	en_GB
dc.subject	Matrices -- Mathematical models	en_GB
dc.subject	Graph coloring	en_GB
dc.subject	Eulerian graph theory	en_GB
dc.subject	Hamiltonian graph theory	en_GB
dc.title	On the adjacency matrix and the colouring of graphs	en_GB
dc.type	conferenceObject	en_GB
dc.rights.holder	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.	en_GB
dc.bibliographicCitation.conferencename	Thirty-second Southeastern International Conference on Combinatorics : Graph Theory and Computing	en_GB
dc.bibliographicCitation.conferenceplace	Baton Rouge, Louisiana, 26/Feb-02/Mar/2001	en_GB
dc.description.reviewed	peer-reviewed	en_GB
Appears in Collections:	Scholarly Works - FacSciMat

Files in This Item:

File	Description	Size	Format
On the adjacency matrix and the colouring of graphs 2001.pdf Restricted Access		842.87 kB	Adobe PDF	View/Open Request a copy

Show simple item record Statistics