Pages that link to "Item:Q2544365"

The following pages link to On the total coloring of certain graphs (Q2544365):

Displaying 50 items.

• On the total coloring of generalized Petersen graphs (Q271609) (← links)
• A note on total and list edge-colouring of graphs of tree-width 3 (Q293637) (← links)
• On the equitable total chromatic number of cubic graphs (Q298960) (← links)
• Total coloring of certain classes of product graphs (Q327644) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• Total coloring of embedded graphs with maximum degree at least seven (Q391777) (← links)
• \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Generation and properties of snarks (Q463288) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
• Complexity of colouring problems restricted to unichord-free and square, unichord-free graphs (Q496654) (← links)
• A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
• Local condition for planar graphs of maximum degree 7 to be 8-totally colorable (Q534337) (← links)
• The total-chromatic number of some families of snarks (Q536223) (← links)
• Total coloring of planar graphs without 6-cycles (Q617651) (← links)
• Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
• Total chromatic number of unichord-free graphs (Q643026) (← links)
• Entire colouring of plane graphs (Q651038) (← links)
• The total chromatic number of graphs having large maximum degree (Q686156) (← links)
• An upper bound for total colouring of graphs (Q686500) (← links)
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
• On topological relaxations of chromatic conjectures (Q710730) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8 (Q785813) (← links)
• Facial entire colouring of plane graphs (Q898120) (← links)
• Total colorings of planar graphs without small cycles (Q937252) (← links)
• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
• Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\) (Q1196563) (← links)
• Just two total graphs are complementary (Q1233031) (← links)
• The total coloring of a multigraph with maximal degree 4 (Q1259607) (← links)
• The total chromatic number of any multigraph with maximum degree five is at most seven (Q1356668) (← links)
• List edge and list total colourings of multigraphs (Q1366604) (← links)
• A study of the total chromatic number of equibipartite graphs (Q1584229) (← links)
• Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9 (Q1732773) (← links)
• \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
• Total coloring of outer-1-planar graphs: the cold case (Q2039699) (← links)
• Total coloring of recursive maximal planar graphs (Q2078611) (← links)
• Compositions, decompositions, and conformability for total coloring on power of cycle graphs (Q2091818) (← links)
• Total coloring of claw-free planar graphs (Q2151210) (← links)
• On total and edge coloring some Kneser graphs (Q2168715) (← links)
• Total-coloring of sparse graphs with maximum degree 6 (Q2240657) (← links)
• An upper bound for the total chromatic number (Q2277479) (← links)
• On the total-neighbor-distinguishing index by sums (Q2345540) (← links)
• On total colorings of 1-planar graphs (Q2352360) (← links)
• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles (Q2359808) (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
• On total chromatic number of planar graphs without 4-cycles (Q2372576) (← links)
• Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)