On the total coloring of planar graphs.

Recommendations

scientific article; zbMATH DE number 5525887
scientific article; zbMATH DE number 1347005
Complete colorings of planar graphs
On total colorings of 1-planar graphs
On the coloring of maximal planar graphs
Total colourings of planar graphs with large girth
Total colorings of planar graphs with large maximum degree
Total coloring of recursive maximal planar graphs
On total colorings of some special 1-planar graphs
Entire colouring of plane graphs

Cited in

(only showing first 100 items - show all)

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
The total chromatic number of regular graphs of high degree
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Coloring planar perfect graphs by decomposition
On light cycles in plane triangulations
Triangles with restricted degrees of their boundary vertices in plane triangulations
Simultaneous coloring of edges and faces of plane graphs
Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
Triangles with restricted degree sum of their boundary vertices in plane graphs
The total chromatic number of any multigraph with maximum degree five is at most seven
List edge and list total colourings of multigraphs
Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
The total chromatic number of pseudo-outerplanar graphs
Total colourings of planar graphs with large girth
Subgraphs with restricted degrees of their vertices in planar graphs
All tight descriptions of 3-paths in plane graphs with girth at least 9
List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles
Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
Dynamic coloring parameters for graphs with given genus
Colouring of generalized signed triangle-free planar graphs
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
Light edges in degree-constrained graphs
Heavy paths, light stars, and big melons
On the colorings of outerplanar graphs
Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable
List total colorings of planar graphs without triangles at small distance
\((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
Total coloring of planar graphs with maximum degree 7
A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
Structure of edges in plane graphs with bounded dual edge weight
Total coloring of outer-1-planar graphs: the cold case
Total coloring of recursive maximal planar graphs
On linear 2-arboricity of certain graphs
The total coloring of \(K_5\)-minor-free graphs
Total coloring of claw-free planar graphs
On total coloring of some classes of regular graphs
All tight descriptions of 3-paths in plane graphs with girth 8
A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
Edge-coloring of plane multigraphs with many colors on facial cycles
Soft 3-stars in sparse plane graphs
Total-coloring of sparse graphs with maximum degree 6
Light structures in 1-planar graphs with an application to linear 2-arboricity
All tight descriptions of 3-paths centered at 2-vertices in plane graphs with girth at least 6
Total coloring of planar graphs without some chordal 6-cycles
Note on 3-paths in plane graphs of girth 4
Describing tight descriptions of 3-paths in triangle-free normal plane maps
On total colorings of 1-planar graphs
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
All tight descriptions of 4-paths in 3-polytopes with minimum degree 5
Joint extension of two theorems of Kotzig on 3-polytopes
On total chromatic number of planar graphs without 4-cycles
Low 5-stars in normal plane maps with minimum degree 5
On total colorings of some special 1-planar graphs
Refined weight of edges in normal plane maps
Total coloring of planar graphs without adjacent chordal 6-cycles
Total colorings of planar graphs with sparse triangles
Short proofs of coloring theorems on planar graphs
Total colorings of planar graphs without chordal 6-cycles
A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
A survey on the distance-colouring of graphs
New linear-time algorithms for edge-coloring planar graphs
Facial list colourings of plane graphs
Light 3-stars in sparse plane graphs
Entire \((\varDelta +2)\)-colorability of plane graphs
Reconfiguring 10-colourings of planar graphs
The complete chromatic number of some planar graphs
Weight of edges in normal plane maps
Total coloring of planar graphs without chordal 7-cycles
Relative clique number of planar signed graphs
Total coloring of planar graphs without short cycles
On the maximum weight of a sparse connected graph of given order and size
Light subgraphs in graphs with average degree at most four
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k
Edge-face coloring of plane graphs with maximum degree nine
On oriented relative clique number
A note on the minimum total coloring of planar graphs
Total coloring of certain classes of product graphs
An extension of Kotzig's theorem
The number of colorings of planar graphs with no separating triangles
scientific article; zbMATH DE number 5525887 (Why is no real title available?)
Total-Coloring of Plane Graphs with Maximum Degree Nine
Describing (d-2)-stars at d-vertices, d 5, in normal plane maps
Total coloring of planar graphs with 7-cycles containing at most two chords
Total coloring of embedded graphs with maximum degree at least seven
Total coloring of planar graphs with maximum degree 8
Describing 3-paths in normal plane maps
scientific article; zbMATH DE number 64356 (Why is no real title available?)
( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
\((k,1)\)-coloring of sparse graphs
On total 9-coloring planar graphs of maximum degree seven
scientific article; zbMATH DE number 1299961 (Why is no real title available?)
Small minors in dense graphs
A note on the total coloring of planar graphs without adjacent 4-cycles
Total colorings of planar graphs with large maximum degree
scientific article; zbMATH DE number 1934402 (Why is no real title available?)
Total colorings of planar graphs without intersecting 5-cycles
scientific article; zbMATH DE number 2060071 (Why is no real title available?)
Coloring 3-power of 3-subdivision of subcubic graph
Randomly colouring graphs (a combinatorial view)

This page was built for publication: On the total coloring of planar graphs.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3798676)