On the total coloring of certain graphs
From MaRDI portal
Publication:2544365
Cites work
Cited in
(81)- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Adjacent strong edge colorings and total colorings of regular graphs
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
- Just two total graphs are complementary
- The total coloring of a multigraph with maximal degree 4
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- A study of the total chromatic number of equibipartite graphs
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9
- \((\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 outer-1-planar graphs: the cold case
- Total coloring of recursive maximal planar graphs
- Compositions, decompositions, and conformability for total coloring on power of cycle graphs
- Total coloring of claw-free planar graphs
- On total and edge coloring some Kneser graphs
- Total-coloring of sparse graphs with maximum degree 6
- An upper bound for the total chromatic number
- On the total-neighbor-distinguishing index by sums
- On total colorings of 1-planar graphs
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- (d,1)-total labelling of planar graphs with large girth and high maximum degree
- On total chromatic number of planar graphs without 4-cycles
- Colorings with few colors: counting, enumeration and combinatorial bounds
- \(L(2, 1)\)-labelings of the edge-path-replacement of a graph
- On total colorings of some special 1-planar graphs
- Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10
- A concise proof for total coloring subcubic graphs
- The hunting of a snark with total chromatic number 5
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- \( L ( p , q )\)-labelings of subdivisions of graphs
- On the total coloring of generalized Petersen graphs
- On coloring problems of snark families
- Total chromatic number of \{square,unichord\}-free graphs
- A note on total and list edge-colouring of graphs of tree-width 3
- On the equitable total chromatic number of cubic graphs
- Colorings with few colors: counting, enumeration and combinatorial bounds
- Total coloring of certain classes of product graphs
- The total chromatic number of some bipartite graphs
- L(d,1)-labelings of the edge-path-replacement of a graph
- Total coloring of embedded graphs with maximum degree at least seven
- ( + 1)-total-colorability of plane graphs with maximum degree at least 6 and without adjacent short cycles
- Coloring 3-power of 3-subdivision of subcubic graph
- Randomly colouring graphs (a combinatorial view)
- Generation and properties of snarks
- \(L(2,1)\)-labelings of subdivisions of graphs
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs
- Total coloring of quasi-line graphs and inflated graphs
- Total chromatic number of honeycomb network
- TOTAL COLORING OF CERTAIN GRAPHS
- scientific article; zbMATH DE number 7528057 (Why is no real title available?)
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- The total-chromatic number of some families of snarks
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS
- scientific article; zbMATH DE number 2230302 (Why is no real title available?)
- Total coloring of planar graphs without some adjacent cycles
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs
- On total coloring and equitable total coloring of infinite snark families
- Total coloring conjecture on certain classes of product graphs
- Total coloring of planar graphs without 6-cycles
- On the conformability of regular line graphs
- Total coloring of embedded graphs of maximum degree at least ten
- Total chromatic number of unichord-free graphs
- Entire colouring of plane graphs
- On the total chromatic number of the direct product of cycles and complete graphs
- Total coloring of middle graph of certain snake graph families
- Computation of total chromatic number for certain convex polytope graphs
- The total chromatic number of graphs having large maximum degree
- An upper bound for total colouring of graphs
- A sufficient condition for complete multipartite graphs to be of type 1
- On efficient total colorings of regular graphs
- Total colorings of k-regular graphs of girths 2k and k
- New results on type 2 snarks
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
- On topological relaxations of chromatic conjectures
- Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8
- Facial entire colouring of plane graphs
- Total colorings of planar graphs without small cycles
This page was built for publication: On the total coloring of certain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2544365)
