scientific article; zbMATH DE number 890665
From MaRDI portal
Publication:4882549
zbMATH Open0860.05029MaRDI QIDQ4882549FDOQ4882549
Authors: Maryam Mirzakhani 
Publication date: 18 June 1996
Title of this publication is not available (Why is that?)
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (27)
- List 4-colouring of planar graphs
- Planar graphs without cycles of specific lengths
- Extending graph colorings
- On list-coloring outerplanar graphs
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
- On group choosability of graphs. II
- A tour through Mirzakhani’s work on moduli spaces of Riemann surfaces
- On choosability with separation of planar graphs without adjacent short cycles
- DP-4-coloring of planar graphs with some restrictions on cycles
- \(4\)-colouring of generalized signed planar graphs
- The Alon-Tarsi number of a planar graph minus a matching
- Smaller planar triangle-free graphs that are not 3-list-colorable
- Distance constraints in graph color extensions
- Coloring face-hypergraphs of graphs on surfaces
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- List colourings of planar graphs
- Multiple list colouring of planar graphs
- A refinement of choosability of graphs
- List precoloring extension in planar graphs
- A sufficient condition for planar graphs to be (3,1)-choosable
- On two problems of defective choosability of graphs
- List dynamic 4-coloring of planar graphs
- You can't paint yourself into a corner
- List coloring and diagonal coloring for plane graphs of diameter two
- On 3-choosability of planar graphs without certain cycles
- A small non-\(\mathbb Z_4\)-colorable planar graph
- A sufficient condition for a planar graph to be 4-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)
