On the total coloring of planar graphs.
From MaRDI portal
Publication:3798676
DOI10.1515/crll.1989.394.180zbMath0653.05029OpenAlexW21046168MaRDI QIDQ3798676
Publication date: 1989
Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002206315
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces ⋮ Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ All tight descriptions of 3-paths in plane graphs with girth at least 9 ⋮ The total coloring of \(K_5\)-minor-free graphs ⋮ Weight of edges in normal plane maps ⋮ All tight descriptions of 4-paths in 3-polytopes with minimum degree 5 ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ Joint extension of two theorems of Kotzig on 3-polytopes ⋮ Heavy paths, light stars, and big melons ⋮ On the maximum weight of a sparse connected graph of given order and size ⋮ Light subgraphs in graphs with average degree at most four ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ List 2-distance \(\varDelta +3\)-coloring of planar graphs without 4,5-cycles ⋮ Triangles with restricted degree sum of their boundary vertices in plane graphs ⋮ On oriented relative clique number ⋮ The total chromatic number of any multigraph with maximum degree five is at most seven ⋮ Total coloring of certain classes of product graphs ⋮ Total coloring of claw-free planar graphs ⋮ An extension of Kotzig's theorem ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ List edge and list total colourings of multigraphs ⋮ Four gravity results ⋮ \([r,s,t\)-colorings of graphs] ⋮ On the colorings of outerplanar graphs ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ On total coloring of some classes of regular graphs ⋮ Subgraphs with restricted degrees of their vertices in planar 3-connected graphs ⋮ The total chromatic number of pseudo-outerplanar graphs ⋮ Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps ⋮ 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 ⋮ Total coloring of planar graphs with 7-cycles containing at most two chords ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ Dynamic coloring parameters for graphs with given genus ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ Describing 3-paths in normal plane maps ⋮ Weight of 3-paths in sparse plane graphs ⋮ List injective colorings of planar graphs ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Total coloring of planar graphs without 6-cycles ⋮ Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ \((k,1)\)-coloring of sparse graphs ⋮ Facial entire colouring of plane graphs ⋮ Optimal unavoidable sets of types of 3-paths for planar graphs of given girth ⋮ Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ 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\) ⋮ Small minors in dense graphs ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Soft 3-stars in sparse plane graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Describing short paths in plane graphs of girth at least 5 ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total colorings of planar graphs without small cycles ⋮ Total coloring of planar graphs without chordal short cycles ⋮ An improved upper bound on the linear 2-arboricity of planar graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ An introduction to the discharging method via graph coloring ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ A note on the linear 2-arboricity of planar graphs ⋮ Injective colorings of graphs with low average degree ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ Injective colorings of sparse graphs ⋮ Light edges in 3-connected 2-planar graphs with prescribed minimum degree ⋮ A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 ⋮ Structure of edges in plane graphs with bounded dual edge weight ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ List coloring the square of sparse graphs with large degree ⋮ Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\) ⋮ The \(L(p, q)\)-labelling of planar graphs without 4-cycles ⋮ A larger family of planar graphs that satisfy the total coloring conjecture ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ Light edges in degree-constrained graphs ⋮ Light structures in 1-planar graphs with an application to linear 2-arboricity ⋮ Total coloring of recursive maximal planar graphs ⋮ 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 ⋮ On light cycles in plane triangulations ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Triangles with restricted degrees of their boundary vertices in plane triangulations ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ 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 ⋮ On linear 2-arboricity of certain graphs ⋮ 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 ⋮ Simultaneous coloring of edges and faces of plane graphs ⋮ Paths with restricted degrees of their vertices in planar graphs ⋮ Total chromatic number of honeycomb network ⋮ Edge-face coloring of plane graphs with maximum degree nine ⋮ Facial list colourings of plane graphs ⋮ Low 5-stars in normal plane maps with minimum degree 5 ⋮ Light 3-stars in sparse plane graphs ⋮ Entire \((\varDelta +2)\)-colorability of plane graphs ⋮ Coloring 3-power of 3-subdivision of subcubic graph ⋮ TOTAL COLORING OF CERTAIN GRAPHS ⋮ On total colorings of some special 1-planar graphs ⋮ Refined weight of edges in normal plane maps ⋮ Plane Graphs with Maximum Degree Are Entirely ‐Colorable ⋮ Total coloring of planar graphs without adjacent chordal 6-cycles ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Structure of edges of embedded graphs with minimum degree two ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Total coloring conjecture on certain classes of product graphs ⋮ More on the structure of plane graphs with prescribed degrees of vertices, faces, edges and dual edges ⋮ Total colorings of planar graphs with sparse triangles ⋮ Unnamed Item ⋮ 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 ⋮ Unnamed Item ⋮ New linear-time algorithms for edge-coloring planar graphs ⋮ On total 9-coloring planar graphs of maximum degree seven ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Relative Clique Number of Planar Signed Graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Tight Descriptions of 3‐Paths in Normal Plane Maps
This page was built for publication: On the total coloring of planar graphs.
