Pages that link to "Item:Q4355071"

The following pages link to Total colorings of planar graphs with large maximum degree (Q4355071):

Displaying 50 items.

• Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
• Total coloring of planar graphs without short cycles (Q281812) (← links)
• \(L(d,1)\)-labelings of the edge-path-replacement of a graph (Q386438) (← links)
• Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
• Total colorings of \(F_5\)-free planar graphs with maximum degree 8 (Q405156) (← 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)
• Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• \(L(2,1)\)-labelings of subdivisions of graphs (Q472974) (← links)
• A note on maximum differential coloring of planar graphs (Q473207) (← 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 colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← links)
• Entire colouring of plane graphs (Q651038) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
• Total colorings of planar graphs without small cycles (Q937252) (← 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)
• List-edge and list-total colorings of graphs embedded on hyperbolic surfaces (Q998357) (← links)
• Total colorings of planar graphs without adjacent triangles (Q998509) (← links)
• On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles (Q1033023) (← 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)
• List edge and list total colourings of multigraphs (Q1366604) (← links)
• Total colourings of planar graphs with large girth (Q1378290) (← links)
• Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
• Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← 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 planar graphs with maximum degree \(7\) (Q1944191) (← links)
• Total coloring of recursive maximal planar graphs (Q2078611) (← links)
• The total coloring of \(K_5\)-minor-free graphs (Q2122692) (← links)
• \((d,1)\)-total labelling of planar graphs with large girth and high maximum degree (Q2370454) (← links)
• \(L(2, 1)\)-labelings of the edge-path-replacement of a graph (Q2392735) (← links)
• On total colorings of some special 1-planar graphs (Q2401770) (← links)
• Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← links)
• Total colorings of planar graphs with sparse triangles (Q2437770) (← 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)
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
• \( L ( p , q )\)-labelings of subdivisions of graphs (Q2659077) (← links)
• Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)