List total coloring of pseudo-outerplanar graphs
From MaRDI portal
Publication:393451
DOI10.1016/J.DISC.2013.06.007zbMATH Open1281.05065arXiv1304.6266OpenAlexW2059584709MaRDI QIDQ393451FDOQ393451
Authors: Xin Zhang 
Publication date: 23 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1304.6266
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles
- List edge and list total colourings of multigraphs
- Graph theory with applications
- List edge and list total colorings of planar graphs without 4-cycles
- Edge covering pseudo-outerplanar graphs with forests
- List total colorings of series-parallel graphs
- Choosability, edge choosability and total choosability of outerplane graphs
- List total colorings of planar graphs without triangles at small distance
- List Total Colourings of Graphs
- Title not available (Why is that?)
- List edge and list total colorings of planar graphs without short cycles
- List-edge and list-total colorings of graphs embedded on hyperbolic surfaces
Cited In (13)
- Incidence coloring of outer-1-planar graphs
- On list-coloring outerplanar graphs
- Total colorings-a survey
- Edge covering pseudo-outerplanar graphs with forests
- The structure and the list 3-dynamic coloring of outer-1-planar graphs
- Light paths and edges in families of outer-1-planar graphs
- Linear arboricity of outer-1-planar graphs
- Total coloring of outer-1-planar graphs: the cold case
- List edge coloring of outer-1-planar graphs
- Conflict-free incidence coloring of outer-1-planar graphs
- The edge chromatic number of outer-1-planar graphs
- Total coloring of outer-1-planar graphs with near-independent crossings
- On list-coloring extendable outerplanar 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)
