scientific article; zbMATH DE number 890665
From MaRDI portal
Publication:4882549
zbMath0860.05029MaRDI QIDQ4882549
Publication date: 18 June 1996
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 (22)
The choice number versus the chromatic number for graphs embeddable on orientable surfaces ⋮ Multiple list colouring of planar graphs ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Distance constraints in graph color extensions ⋮ \(4\)-colouring of generalized signed planar graphs ⋮ List 4-colouring of planar graphs ⋮ The Alon-Tarsi number of a planar graph minus a matching ⋮ A tour through Mirzakhani’s work on moduli spaces of Riemann surfaces ⋮ On list-coloring outerplanar graphs ⋮ DP-4-coloring of planar graphs with some restrictions on cycles ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ On 3-choosability of planar graphs without certain cycles ⋮ List precoloring extension in planar graphs ⋮ Planar graphs without cycles of specific lengths ⋮ On group choosability of graphs. II ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ A refinement of choosability of graphs ⋮ List coloring and diagonal coloring for plane graphs of diameter two ⋮ You can't paint yourself into a corner ⋮ Extending graph colorings ⋮ Coloring face-hypergraphs of graphs on surfaces
This page was built for publication:
