Pages that link to "Item:Q3422127"

The following pages link to Total chromatic number of planar graphs with maximum degree ten (Q3422127):

Displaying 44 items.

• Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
• Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
• Total coloring of planar graphs with 7-cycles containing at most two chords (Q391771) (← 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)
• On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
• A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
• (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← 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)
• Total coloring of planar graphs without chordal short cycles (Q497376) (← 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)
• Total coloring of planar graphs without 6-cycles (Q617651) (← links)
• Total choosability of planar graphs with maximum degree 4 (Q617905) (← 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)
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
• Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
• Total coloring of planar graphs of maximum degree eight (Q991795) (← links)
• Equitable total coloring of \(C_m\square C_n\) (Q1028450) (← links)
• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← links)
• The total chromatic number of regular graphs of high degree (Q1042999) (← links)
• Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
• On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
• Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
• List total colorings of planar graphs without triangles at small distance (Q1942193) (← 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 recursive maximal planar graphs (Q2078611) (← links)
• The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
• Total coloring of claw-free planar graphs (Q2151210) (← links)
• Total coloring of planar graphs without some chordal 6-cycles (Q2340805) (← links)
• Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
• Total colorings of planar graphs without chordal 6-cycles (Q2449112) (← links)
• A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
• \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
• Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
• Total chromatic number of {square,unichord}-free graphs (Q2883635) (← links)
• A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
• Edge-face coloring of plane graphs with maximum degree nine (Q3168662) (← links)
• Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable (Q6047966) (← links)