Pages that link to "Item:Q937252"
From MaRDI portal
The following pages link to Total colorings of planar graphs without small cycles (Q937252):
Displaying 32 items.
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← links)
- Total colorings of planar graphs with small maximum degree (Q360968) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← 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)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Incidence coloring of planar graphs without adjacent small cycles (Q501990) (← 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 coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- A larger family of planar graphs that satisfy the total coloring conjecture (Q742577) (← 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)
- Total colorings of planar graphs without adjacent triangles (Q998509) (← 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-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← 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)
- Total coloring of planar graphs without some chordal 6-cycles (Q2340805) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← links)
- On total chromatic number of planar graphs without 4-cycles (Q2372576) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
- Minimum total coloring of planar graphs with maximum degree 8 (Q2698022) (← links)
- Total colorings of planar graphs without 6-cycles and adjacent 5-cycles (Q2824287) (← links)
- Total colorings of planar graphs with large maximum degree (Q4355071) (← links)
- Planar graph colorings without short monochromatic cycles (Q4736767) (← links)
- A note on total colorings of planar graphs without 4-cycles (Q4823300) (← links)
