Total colorings of planar graphs without adjacent triangles
Let \(G=\left(V(G), E(G)\right)\) be a graph with maximum degree \(\Delta\). A total \(k\)-coloring of \(G\) is a coloring of \(V(G) \cup E(G)\) using \(k\) colors such that no two adjacent or incident elements receive the same color. The total chromatic number \(\chi(G)\) is the smallest integer \(k\) such that \(G\) has a total \(k\)-coloring. The well-known Total Coloring Conjecture asserts that \(\Delta+1 \leq \chi(G) \leq \Delta+2\). A partial result is established in this paper as follows. The Total Coloring Conjecture is true for a planar graph \(G\) without adjacent 3-cycles. Furthermore, \(\chi(G)=\Delta+1\) if \(\Delta \geq 9\).
- Total coloring of planar graphs without some adjacent cycles
- The number of colorings of planar graphs with no separating triangles
- Acyclic edge coloring of planar graphs without adjacent triangles
- On edge colorings of 1-planar graphs without adjacent triangles
- Total coloring of planar graphs without adjacent short cycles
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- Total colorings of planar graphs with sparse triangles
- Total colorings of planar graphs without small cycles
- On acyclic edge coloring of planar graphs without intersecting triangles
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- A note on total colorings of planar graphs without 4-cycles
- On total 9-coloring planar graphs of maximum degree seven
- The total chromatic number of any multigraph with maximum degree five is at most seven
- The total coloring of a multigraph with maximal degree 4
- Total colorings of planar graphs with large maximum degree
- Total colourings of graphs
- Total colourings of planar graphs with large girth
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total coloring of outer-1-planar graphs with near-independent crossings
- Colouring of generalized signed triangle-free planar graphs
- List total colorings of planar graphs without triangles at small distance
- A sufficient condition for planar graphs with maximum degree 6 to be totally 8-colorable
- Total coloring of recursive maximal planar graphs
- A sufficient condition for planar graphs of maximum degree 6 to be totally 7-colorable
- Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles
- On total colorings of some special 1-planar graphs
- Total coloring of planar graphs without adjacent chordal 6-cycles
- Total colorings of planar graphs with sparse triangles
- Facial list colourings of plane graphs
- A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
- The number of colorings of planar graphs with no separating triangles
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Acyclic total colorings of planar graphs without \(l\) cycles
- Total coloring of planar graphs without chordal short cycles
- Local condition for planar graphs of maximum degree 7 to be 8-totally colorable
- The total coloring of planar graphs with a few 3-faces incidents with vertex
- Total colorings-a survey
- Total coloring of planar graphs without 6-cycles
- A larger family of planar graphs that satisfy the total coloring conjecture
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- On total chromatic number of direct product graphs
This page was built for publication: Total colorings of planar graphs without adjacent triangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998509)
