pith. sign in

arxiv: 1306.4434 · v2 · pith:W7HBR6TGnew · submitted 2013-06-19 · 🧮 math.CO

An Introduction to the Discharging Method via Graph Coloring

Daniel W. Cranston , Douglas B. West This is my paper
classification 🧮 math.CO
keywords coloringdischarginggraphmethodtechniquealongapplicationapplications
0
0 comments X
read the original abstract

We provide a "how-to" guide to the use and application of the Discharging Method. Our aim is not to exhaustively survey results proved by this technique, but rather to demystify the technique and facilitate its wider use, using applications in graph coloring as examples. Along the way, we present some new proofs and new problems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)

    math.CO 2022-10 unverdicted

    This is a survey compiling results on strong edge-coloring and related coloring problems for squares of graphs in planar and sparse classes.