Recommendations
Cites work
- scientific article; zbMATH DE number 2192154 (Why is no real title available?)
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Choosability, edge choosability and total choosability of outerplane graphs
- Determining the total colouring number is NP-hard
- Edge and total coloring of interval graphs
- Fractionally colouring total graphs
- Graph theory with applications
- List Total Colourings of Graphs
- List edge and list total colourings of multigraphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Minimum number of disjoint linear forests covering a planar graph
- On maximal injective subalgebras in a \(w\Gamma\) factor
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- On the total coloring of planar graphs.
- On total 9-coloring planar graphs of maximum degree seven
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- The \(r\)-acyclic chromatic number of planar graphs
- The chromatic index of complete multipartite graphs
- The last fraction of a fractional conjecture
- The total chromatic number of any multigraph with maximum degree five is at most seven
- Total chromatic number of completer-partite graphs
- Total coloring of planar graphs of maximum degree eight
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- Total colorings of planar graphs with maximum degree at least 8
- Total colouring regular bipartite graphs is NP-hard
- Total colourings of graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
Cited in
(16)- Total coloring of planar graphs without adjacent short cycles
- A note on the minimum number of choosability of planar graphs
- Total coloring of planar graphs without chordal 7-cycles
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs
- scientific article; zbMATH DE number 5904019 (Why is no real title available?)
- Total colorings-a survey
- Total coloring of planar graphs without short cycles
- Minimal colorings for properly colored subgraphs
- Optimal channel assignment with list-edge coloring
- Minimum choosability of planar graphs
- On \((p,1)\)-total labelling of planar graphs
- A note on the minimum total coloring of planar graphs
- List edge and list total coloring of planar graphs with maximum degree 8
- Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles
- Total coloring of planar graphs without adjacent chordal 6-cycles
- An efficient case for computing minimum linear arboricity with small maximum degree
This page was built for publication: Minimum total coloring of planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475814)
