scientific article
From MaRDI portal
Publication:3784093
zbMath0643.05029MaRDI QIDQ3784093
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
total colouringmaximum degreegeneral colouringsimultaneous chromatic numberssimultaneous colouring of a graph
Related Items (22)
The entire choosability of plane graphs ⋮ Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces ⋮ Weight of edges in normal plane maps ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Plane graphs with maximum degree 9 are entirely 11-choosable ⋮ Facial list colourings of plane graphs ⋮ Simultaneously colouring the edges and faces of plane graphs ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ On the colorings of outerplanar graphs ⋮ Refined weight of edges in normal plane maps ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ Plane graphs with \(\Delta = 7\) are entirely 10-colorable ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Unnamed Item ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles ⋮ Simultaneous coloring of edges and faces of plane graphs ⋮ All subgraphs of a wheel are 5-coupled-choosable
This page was built for publication:
