Colorings of plane graphs: A survey
Author:
- O.V. BorodinOBO.V. Borodin
- 1 February 2013
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 313 (4) , 517-539
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education and Science of the Russian Federation (14.740.11.0868)
- Russian Foundation for Basic Research
This publication has 144 references indexed in Scilit:
- A sufficient condition for planar graphs to be acyclically 5‐choosableJournal of Graph Theory, 2011
- On acyclic 4-choosability of planar graphs without short cyclesDiscrete Mathematics, 2010
- Distance constrained labelings of planar graphs with no short cyclesDiscrete Applied Mathematics, 2009
- Edge choosability of planar graphs without 5-cycles with a chordDiscrete Mathematics, 2009
- List-edge and list-total colorings of graphs embedded on hyperbolic surfacesDiscrete Mathematics, 2008
- Structural properties and edge choosability of planar graphs without 4-cyclesDiscrete Mathematics, 2008
- Bordeaux 3-color conjecture and 3-choosabilityDiscrete Mathematics, 2006
- Good and semi-strong colorings of oriented planar graphsInformation Processing Letters, 1994
- Colorings and orientations of graphsCombinatorica, 1992
- The total coloring of a multigraph with maximal degree 4Discrete Mathematics, 1977