Minimum total coloring of planar graph
From MaRDI portal
Publication:475814
DOI10.1007/s10898-013-0138-yzbMath1308.90193OpenAlexW2073517850MaRDI QIDQ475814
Panos M. Pardalos, Lidong Wu, Hui-Juan Wang, Weili Wu, Jian Liang Wu
Publication date: 27 November 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0138-y
Related Items (14)
A note on the minimum number of choosability of planar graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ Total coloring of planar graphs without short cycles ⋮ 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 ⋮ Optimal channel assignment with list-edge coloring ⋮ Total colorings-a survey ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ On \((p,1)\)-total labelling of planar graphs ⋮ The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs ⋮ Minimum choosability of planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Minimum number of disjoint linear forests covering a planar graph
- A note on the total coloring of planar graphs without adjacent 4-cycles
- Determining the total colouring number is NP-hard
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Total coloring of planar graphs of maximum degree eight
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- On maximal injective subalgebras in a \(w\Gamma\) factor
- Total colorings of planar graphs with maximum degree at least 8
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- Total colouring regular bipartite graphs is NP-hard
- Fractionally colouring total graphs
- The total chromatic number of any multigraph with maximum degree five is at most seven
- List edge and list total colourings of multigraphs
- Choosability, edge choosability and total choosability of outerplane graphs
- Total colourings of graphs
- Total colorings of planar graphs with maximum degree 8 and without 5-cycles with two chords
- The \(r\)-acyclic chromatic number of planar graphs
- Total-Coloring of Plane Graphs with Maximum Degree Nine
- On the total coloring of planar graphs.
- The chromatic index of complete multipartite graphs
- Total chromatic number of completer-partite graphs
- List Total Colourings of Graphs
- On total 9-coloring planar graphs of maximum degree seven
- The Last Fraction of a Fractional Conjecture
- Edge and total coloring of interval graphs
This page was built for publication: Minimum total coloring of planar graph
