Total colourings of graphs
From MaRDI portal
Publication:1910691
DOI10.1007/BFb0092895zbMath0839.05001MaRDI QIDQ1910691
Publication date: 20 March 1996
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (78)
Behzad-Vizing conjecture and Cartesian-product graphs ⋮ Total chromatic number of {square,unichord}-free graphs ⋮ The total coloring of \(K_5\)-minor-free graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Even-power of cycles with many vertices are type 1 total colorable ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ The tournament scheduling problem with absences ⋮ A note on the minimum total coloring of planar graphs ⋮ Total coloring of claw-free planar graphs ⋮ Complexity separating classes for edge-colouring and total-colouring ⋮ \([r,s,t\)-colorings of graphs] ⋮ \([r,s,t\)-chromatic numbers and hereditary properties of graphs] ⋮ On total coloring of some classes of regular graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ The total chromatic number of pseudo-outerplanar graphs ⋮ A result on the total colouring of powers of cycles ⋮ Edge-colouring and total-colouring chordless graphs ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Total coloring and total matching: polyhedra and facets ⋮ Total coloring of planar graphs without 6-cycles ⋮ Total choosability of planar graphs with maximum degree 4 ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ On the total choosability of planar graphs and of sparse graphs ⋮ Results about the total chromatic number and the conformability of some families of circulant graphs ⋮ Coloring Hanoi and Sierpiński graphs ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ Total colorings-a survey ⋮ The undirected optical indices of complete \(m\)-ary trees ⋮ Total coloring conjecture on certain classes of product graphs ⋮ \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle ⋮ The total chromatic number of graphs of even order and high degree ⋮ (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles ⋮ Total coloring of rooted path graphs ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the Cartesian product of graphs ⋮ Total colorings of planar graphs without intersecting 5-cycles ⋮ Total chromatic number of unichord-free graphs ⋮ Unnamed Item ⋮ Total coloring conjecture for vertex, edge and neighborhood corona products of graphs ⋮ The hunting of a snark with total chromatic number 5 ⋮ Total colorings of planar graphs without chordal 6-cycles ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ Acyclic total colorings of planar graphs without \(l\) cycles ⋮ Minimum total coloring of planar graph ⋮ On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\) ⋮ Total coloring of planar graphs without chordal short cycles ⋮ Total colorings of product graphs ⋮ Semi-total graph colourings, the beta parameter, and total chromatic number ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ Entire coloring of graphs embedded in a surface of nonnegative characteristic ⋮ Unnamed Item ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) ⋮ On total chromatic number of direct product graphs ⋮ List total colorings of series-parallel graphs ⋮ Edge and total coloring of interval graphs ⋮ A note on total colourings of digraphs ⋮ Total coloring conjecture for certain classes of graphs ⋮ Total and fractional total colourings of circulant graphs ⋮ Total colorings of planar graphs without adjacent triangles ⋮ Vertex-, edge-, and total-colorings of Sierpiński-like graphs ⋮ Unnamed Item ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ \([r,s,t\)-coloring of \(K_{n,n}\)] ⋮ The total chromatic number of regular graphs of high degree ⋮ On \((d,1)\)-total numbers of graphs ⋮ Total colorings of equibipartite graphs ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs ⋮ Total chromatic number of graphs of odd order and high degree ⋮ Adjacent vertex distinguishing edge-colorings and total-colorings of the lexicographic product of graphs ⋮ Behzad-Vizing conjecture and Cartesian product graphs ⋮ Total colorings of certain classes of lexicographic product graphs ⋮ Total colorings of circulant graphs ⋮ Not necessarily proper total colourings which are adjacent vertex distinguishing ⋮ Some colouring problems for Paley graphs
This page was built for publication: Total colourings of graphs
