Pages that link to "Item:Q998509"
From MaRDI portal
The following pages link to Total colorings of planar graphs without adjacent triangles (Q998509):
Displaying 14 items.
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← 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)
- 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)
- On total chromatic number of direct product graphs (Q980443) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable (Q2030446) (← links)
- Total coloring of recursive maximal planar graphs (Q2078611) (← links)
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable (Q2183240) (← links)
- On total colorings of some special 1-planar graphs (Q2401770) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
