k-forested choosability of planar graphs and sparse graphs
- 6 March 2012
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 312 (5) , 999-1005
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Linear choosability of sparse graphsDiscrete Mathematics, 2011
- Linear and 2-Frugal Choosability of Graphs of Small Maximum Average DegreeGraphs and Combinatorics, 2011
- Improved bounds on linear coloring of plane graphsScience China Mathematics, 2010
- Linear choosability of graphsDiscrete Mathematics, 2008
- Oriented colorings of 2-outerplanar graphsInformation Processing Letters, 2007
- Acyclic Colourings of Planar Graphs with Large GirthJournal of the London Mathematical Society, 1999
- The Cyclic Coloring Problem and Estimation of Sparse Hessian MatricesSIAM Journal on Algebraic Discrete Methods, 1986
- Estimation of sparse hessian matrices and graph coloring problemsMathematical Programming, 1984
- On acyclic colorings of planar graphsDiscrete Mathematics, 1979
- Acyclic colorings of planar graphsIsrael Journal of Mathematics, 1973