List-edge and list-total colorings of graphs embedded on hyperbolic surfaces

DOI10.1016/j.disc.2007.11.044zbMath1189.05067OpenAlexW2069528460MaRDI QIDQ998357

Ping Wang, Jian Liang Wu

Publication date: 28 January 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.11.044

zbMATH Keywords

choosabilitylist coloringlist-total coloringlist edge chromatic numberlist-edge coloringsurface of negative Euler characteristictotallzy \(k\)-choosable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (26)

List edge and list total coloring of planar graphs without intersecting 8-cycles ⋮ Facial list colourings of plane graphs ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ List total coloring of pseudo-outerplanar graphs ⋮ Total coloring of planar graphs with maximum degree 8 ⋮ The structure of plane graphs with independent crossings and its applications to coloring problems ⋮ On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Total coloring of embedded graphs of maximum degree at least ten ⋮ A note on the total coloring of planar graphs without adjacent 4-cycles ⋮ List-edge-coloring of planar graphs without 6-cycles with three chords ⋮ Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles ⋮ Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles ⋮ List edge coloring of planar graphs without 6-cycles with two chords ⋮ On \((p,1)\)-total labelling of 1-planar graphs ⋮ Minimum total coloring of planar graph ⋮ Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ On \((p, 1)\)-total labelling of some 1-planar graphs ⋮ Total coloring of planar graphs without chordal short cycles ⋮ On \((p, 1)\)-total labelling of NIC-planar graphs ⋮ Total coloring of planar graphs without adjacent short cycles ⋮ A structure of 1-planar graph and its applications to coloring problems ⋮ List edge and list total coloring of 1-planar graphs ⋮ List edge colorings of planar graphs without adjacent 7-cycles ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• List edge and list total colourings of multigraphs
• Edge colorings of embedded graphs
• Edge colorings of graphs embeddable in a surface of low genus
• On simultaneous colorings of embedded graphs
• The chromatic class and the location of a graph on a closed surface
• Total colorings of planar graphs with large maximum degree
• On the Total Coloring of Graphs Embeddable in Surfaces
• 25 pretty graph colouring problems

This page was built for publication: List-edge and list-total colorings of graphs embedded on hyperbolic surfaces