On the total coloring of certain graphs
From MaRDI portal
Publication:2544365
DOI10.1007/BF02771690zbMath0211.56604OpenAlexW2050181703MaRDI QIDQ2544365
Publication date: 1971
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02771690
Related Items (74)
Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles ⋮ Total chromatic number of {square,unichord}-free graphs ⋮ Total chromatic number of honeycomb network ⋮ On the total coloring of generalized Petersen graphs ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree ⋮ On total chromatic number of planar graphs without 4-cycles ⋮ On the equitable total chromatic number of cubic graphs ⋮ 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 ⋮ Coloring 3-power of 3-subdivision of subcubic graph ⋮ Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ \(L(2, 1)\)-labelings of the edge-path-replacement of a graph ⋮ List edge and list total colourings of multigraphs ⋮ TOTAL COLORING OF CERTAIN GRAPHS ⋮ On total and edge coloring some Kneser graphs ⋮ On total colorings of some special 1-planar graphs ⋮ \( L ( p , q )\)-labelings of subdivisions of graphs ⋮ \(L(d,1)\)-labelings of the edge-path-replacement of a graph ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ Total coloring of planar graphs without 6-cycles ⋮ \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles ⋮ Total coloring of planar graphs without some adjacent cycles ⋮ Weakening total coloring conjecture and Hadwiger's conjecture on total graphs ⋮ Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Facial entire colouring of plane graphs ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ 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 ⋮ On the conformability of regular line graphs ⋮ Total chromatic number of unichord-free graphs ⋮ A concise proof for total coloring subcubic graphs ⋮ Randomly colouring graphs (a combinatorial view) ⋮ Entire colouring of plane graphs ⋮ Generation and properties of snarks ⋮ The hunting of a snark with total chromatic number 5 ⋮ \(L(2,1)\)-labelings of subdivisions of graphs ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ COLORING ALGORITHMS ON SUBCUBIC GRAPHS ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 ⋮ Total colorings of planar graphs without small cycles ⋮ Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs ⋮ Total-coloring of sparse graphs with maximum degree 6 ⋮ Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) ⋮ A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five ⋮ The total chromatic number of graphs having large maximum degree ⋮ An upper bound for total colouring of graphs ⋮ Local condition for planar graphs of maximum degree 7 to be 8-totally colorable ⋮ The total-chromatic number of some families of snarks ⋮ Unnamed Item ⋮ Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable ⋮ On topological relaxations of chromatic conjectures ⋮ Just two total graphs are complementary ⋮ An upper bound for the total chromatic number ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs ⋮ Total coloring of outer-1-planar graphs: the cold case ⋮ The total coloring of a multigraph with maximal degree 4 ⋮ Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 ⋮ Unnamed Item ⋮ On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles ⋮ On Coloring Problems of Snark Families ⋮ Total coloring of recursive maximal planar graphs ⋮ Adjacent strong edge colorings and total colorings of regular graphs ⋮ Total colorings and list total colorings of planar graphs without intersecting 4-cycles ⋮ Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 ⋮ A study of the total chromatic number of equibipartite graphs ⋮ Compositions, decompositions, and conformability for total coloring on power of cycle graphs ⋮ On the total-neighbor-distinguishing index by sums ⋮ The total chromatic number of some bipartite graphs ⋮ Total coloring of quasi-line graphs and inflated graphs ⋮ On total colorings of 1-planar graphs
Cites Work
This page was built for publication: On the total coloring of certain graphs
