scientific article; zbMATH DE number 890665
From MaRDI portal
Publication:4882549
Recommendations
Cited in
(31)- The complexity of planar graph choosability
- You can't paint yourself into a corner
- Extending graph colorings
- A sufficient condition for planar graphs to be (3,1)-choosable
- Smaller planar triangle-free graphs that are not 3-list-colorable
- Coloring face-hypergraphs of graphs on surfaces
- DP-4-coloring of planar graphs with some restrictions on cycles
- On group choosability of graphs. II
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- 4-colouring of generalized signed planar graphs
- The Alon-Tarsi number of a planar graph minus a matching
- A refinement of choosability of graphs
- List coloring and diagonal coloring for plane graphs of diameter two
- scientific article; zbMATH DE number 986968 (Why is no real title available?)
- Multiple list colouring of planar graphs
- On list-coloring outerplanar graphs
- A tour through Mirzakhani’s work on moduli spaces of Riemann surfaces
- A sufficient condition for a planar graph to be 4-choosable
- List precoloring extension in planar graphs
- List 4-colouring of planar graphs
- On two problems of defective choosability of graphs
- List dynamic 4-coloring of planar graphs
- List colourings of planar graphs
- Planar graphs without cycles of specific lengths
- 5-list coloring toroidal 6-regular triangulations in linear time
- On partial order of -choosability for planar graphs
- On choosability with separation of planar graphs without adjacent short cycles
- A small non-\(\mathbb Z_4\)-colorable planar graph
- Distance constraints in graph color extensions
- On 3-choosability of planar graphs without certain cycles
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882549)
