List total coloring of pseudo-outerplanar graphs
From MaRDI portal
Abstract: A graph is pseudo-outerplanar if each of its blocks has an embedding in the plane so that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. It is proved that every pseudo-outerplanar graph with maximum degree Deltageq 5 is totally (Delta+1)-choosable.
Recommendations
- The total chromatic number of pseudo-outerplanar graphs
- List edge and list total coloring of 1-planar graphs
- Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable
- Choosability, edge choosability and total choosability of outerplane graphs
- Edge and total choosability of near-outerplanar graphs
Cites work
- scientific article; zbMATH DE number 1559126 (Why is no real title available?)
- Choosability, edge choosability and total choosability of outerplane graphs
- Edge covering pseudo-outerplanar graphs with forests
- Graph theory with applications
- List Total Colourings of Graphs
- List edge and list total colorings of planar graphs without 4-cycles
- List edge and list total colorings of planar graphs without short cycles
- List edge and list total colourings of multigraphs
- List total colorings of planar graphs without triangles at small distance
- List total colorings of series-parallel graphs
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Cited in
(13)- On list-coloring outerplanar graphs
- Total colorings-a survey
- Total coloring of outer-1-planar graphs: the cold case
- Linear arboricity of outer-1-planar graphs
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- The edge chromatic number of outer-1-planar graphs
- Conflict-free incidence coloring of outer-1-planar graphs
- Edge covering pseudo-outerplanar graphs with forests
- Total coloring of outer-1-planar graphs with near-independent crossings
- On list-coloring extendable outerplanar graphs
- Incidence coloring of outer-1-planar graphs
- List edge coloring of outer-1-planar graphs
- Light paths and edges in families of outer-1-planar graphs
This page was built for publication: List total coloring of pseudo-outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393451)