On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability

DOI10.1016/j.ejc.2005.09.002zbMath1106.05037OpenAlexW2055775643MaRDI QIDQ854811

Ko-Wei Lih, Wei Fan Wang

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.09.002

zbMATH Keywords

surfaceEuler characteristiclist edge coloring conjecture

Mathematics Subject Classification ID

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

Related Items (2)

Surviving rate of graphs and firefighter problem ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs without cycles of specific lengths
• Edge-choosability of multicircuits
• List edge and list total colourings of multigraphs
• Choosability and edge choosability of planar graphs without five cycles
• List edge-colorings of series-parallel graphs
• Edge choosability of planar graphs without small cycles
• Choosability, edge choosability and total choosability of outerplane graphs
• The list chromatic index of a bipartite multigraph
• Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
• New Bounds on the List-Chromatic Index of the Complete Graph and Other Simple Graphs
• Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles

This page was built for publication: On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability