scientific article
From MaRDI portal
Publication:2716011
zbMath1065.05037MaRDI QIDQ2716011
Publication date: 20 July 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (11)
\((4,2)\)-choosability of planar graphs with forbidden structures ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Single‐conflict colouring ⋮ Choosability with union separation ⋮ List 4-colouring of planar graphs ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ Choosability with union separation of triangle-free planar graphs ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ On Choosability with Separation of Planar Graphs with Forbidden Cycles ⋮ On choosability with separation of planar graphs with lists of different sizes
This page was built for publication:
