An introduction to the discharging method via graph coloring
Authors:
- Daniel W. CranstonDCDaniel W. Cranston
- Douglas B. WestDWDouglas B. West
- 1 April 2017
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 340 (4) , 766-793
Abstract
No abstract availableKeywords
All Related Versions
This publication has 88 references indexed in Scilit:
- Nowhere-zero 3-flows and modulo k-orientationsJournal of Combinatorial Theory, Series B, 2013
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐CyclesJournal of Graph Theory, 2012
- Injective Colorings of Graphs with Low Average DegreeAlgorithmica, 2010
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1Discrete Mathematics, 2006
- Edge choosability of planar graphs without small cyclesDiscrete Mathematics, 2004
- Edge coloring of graphs with small average degreesDiscrete Mathematics, 2004
- Choosability and edge choosability of planar graphs without five cyclesApplied Mathematics Letters, 2002
- A note on the three color problemGraphs and Combinatorics, 1995
- Hadwiger's conjecture forK 6-free graphsCombinatorica, 1993
- Some remarks on a paper by Vizing on critical graphsMathematical Proceedings of the Cambridge Philosophical Society, 1975