The complete chromatic number of some planar graphs (Q1312961): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
(2 intermediate revisions by one other user not shown) | |||
Property / author | |||
Property / author: Zhong Fu Zhang / rank | |||
Property / author | |||
Property / author: Wei Fan Wang / rank | |||
Property / reviewed by | |||
Property / reviewed by: Jozef Fiamčik / rank | |||
Property / author | |||
Property / author: Zhong Fu Zhang / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Wei Fan Wang / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Jozef Fiamčik / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Latest revision as of 03:54, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The complete chromatic number of some planar graphs |
scientific article |
Statements
The complete chromatic number of some planar graphs (English)
0 references
7 February 1994
0 references
The authors consider simultaneous colouring of vertices, edges and faces of a planar connected graph \(G\) (without cut vertex) in which any two adjacent or incident elements are coloured by different colours. Let \(c(G)\) be a minimum number of colours for such type of colouring of elements of \(G\). Authors prove that if \(G\) is an outerplanar graph with maximum vertex degree \(h(G) \geq 7\), or planar graph with order \(p \geq 9\) and \(h(G) \geq p-2\), or maximal planar graph with \(h(G) \geq 14\), then \(c(G)=h+1\).
0 references
chromatic number
0 references
colouring
0 references
planar graph
0 references