An introduction to the discharging method via graph coloring (Q507506): Difference between revisions

@@ Property / OpenAlex ID @@
+W2559217904
@@ Property / OpenAlex ID: W2559217904 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4434
@@ Property / arXiv ID: 1306.4434 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring Powers of Planar Graphs
@@ Property / cites work: Coloring Powers of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3907606
@@ Property / cites work: Q3907606 / rank @@
+Normal rank
@@ Property / cites work @@
+Covering and packing in graphs IV: Linear arboricity
+Normal rank
@@ Property / cites work @@
+A lower bound for the independence number of a planar graph
+Normal rank
@@ Property / cites work @@
+Coloring with no 2-colored \(P_4\)'s
@@ Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank @@
+Normal rank
@@ Property / cites work @@
+The linear arboricity of graphs
@@ Property / cites work: The linear arboricity of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every Planar Map is Four Colorable
@@ Property / cites work: Every Planar Map is Four Colorable / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Covering planar graphs with forests
@@ Property / cites work: Covering planar graphs with forests / rank @@
+Normal rank
@@ Property / cites work @@
+List-colourings of graphs
@@ Property / cites work: List-colourings of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable
+Normal rank
@@ Property / cites work @@
+-Distance Coloring of Sparse Graphs
@@ Property / cites work: 2-Distance Coloring of Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+List coloring the square of sparse graphs with large degree
+Normal rank
@@ Property / cites work @@
+Graphs with maximum degree \(\varDelta\geq 17\) and maximum average degree less than 3 are list 2-distance \((\varDelta +2)\)-colorable
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the total coloring of planar graphs.
@@ Property / cites work: On the total coloring of planar graphs. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3469114
@@ Property / cites work: Q3469114 / rank @@
+Normal rank
@@ Property / cites work @@
+Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
+Normal rank
@@ Property / cites work @@
+Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
+Normal rank
@@ Property / cites work @@
+Structural theorem on plane graphs with application to the entire coloring number
+Normal rank
@@ Property / cites work @@
+Colorings of plane graphs: a survey
@@ Property / cites work: Colorings of plane graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4797462
@@ Property / cites work: Q4797462 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic 3-choosability of sparse graphs with girth at least 7
+Normal rank
@@ Property / cites work @@
+Acyclic list 7‐coloring of planar graphs
@@ Property / cites work: Acyclic list 7‐coloring of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for planar graphs to be 2-distance (\(\Delta+1\))-colourable
+Normal rank
@@ Property / cites work @@
+Planar graphs without cycles of length from 4 to 7 are 3-colorable
+Normal rank
@@ Property / cites work @@
+Circular \((5,2)\)-coloring of sparse graphs
@@ Property / cites work: Circular \((5,2)\)-coloring of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+-distance \((\varDelta +2)\)-coloring of planar graphs with girth six and \(\varDelta \geq 18\)
+Normal rank
@@ Property / cites work @@
+List 2-distance \((\varDelta +2)\)-coloring of planar graphs with girth six
+Normal rank
@@ Property / cites work @@
+Q5391631
@@ Property / cites work: Q5391631 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3115724
@@ Property / cites work: Q3115724 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic 5-choosability of planar graphs without 4-cycles
+Normal rank
@@ Property / cites work @@
+Acyclic 5-choosability of planar graphs without adjacent short cycles
+Normal rank
@@ Property / cites work @@
+Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles
+Normal rank
@@ Property / cites work @@
+Describing 3-faces in normal plane maps with minimum degree 4
+Normal rank
@@ Property / cites work @@
+Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps
+Normal rank
@@ Property / cites work @@
+Sufficient conditions for the minimum 2-distance colorability of plane graphs of girth 6
+Normal rank
@@ Property / cites work @@
+Homomorphisms from sparse graphs with large girth.
+Normal rank
@@ Property / cites work @@
+List edge and list total colourings of multigraphs
+Normal rank
@@ Property / cites work @@
+On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
+Normal rank
@@ Property / cites work @@
+I,F-partitions of sparse graphs
@@ Property / cites work: I,F-partitions of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+Star coloring of sparse graphs
@@ Property / cites work: Star coloring of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some sufficient conditions for a planar graph of maximum degree six to be Class 1
+Normal rank
@@ Property / cites work @@
+Planar graphs without 4- and 5-cycles are acyclically 4-choosable
+Normal rank
@@ Property / cites work @@
+Q5403010
@@ Property / cites work: Q5403010 / rank @@
+Normal rank
@@ Property / cites work @@
+-Star-Coloring of Subcubic Graphs
@@ Property / cites work: 6-Star-Coloring of Subcubic Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
+Normal rank
@@ Property / cites work @@
+Steinberg's conjecture is false
@@ Property / cites work: Steinberg's conjecture is false / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
+Normal rank
@@ Property / cites work @@
+Choosability of the square of a planar graph with maximum degree four
+Normal rank
@@ Property / cites work @@
+The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
+Normal rank
@@ Property / cites work @@
+List-coloring the square of a subcubic graph
@@ Property / cites work: List-coloring the square of a subcubic graph / rank @@
+Normal rank
@@ Property / cites work @@
+Injective colorings of sparse graphs
@@ Property / cites work: Injective colorings of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Injective colorings of graphs with low average degree
+Normal rank
@@ Property / cites work @@
+Sufficient sparseness conditions for \(G^2\) to be \((\Delta + 1)\)-choosable, when \(\Delta \geq 5\)
+Normal rank
@@ Property / cites work @@
+Linear choosability of sparse graphs
@@ Property / cites work: Linear choosability of sparse graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A Planar linear arboricity conjecture
@@ Property / cites work: A Planar linear arboricity conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633932
@@ Property / cites work: Q4633932 / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring squares of planar graphs with girth six
@@ Property / cites work: Coloring squares of planar graphs with girth six / rank @@
+Normal rank
@@ Property / cites work @@
+The linear arboricity of some regular graphs
@@ Property / cites work: The linear arboricity of some regular graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3922703
@@ Property / cites work: Q3922703 / rank @@
+Normal rank
@@ Property / cites work @@
+Fire Containment in Planar Graphs
@@ Property / cites work: Fire Containment in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Star coloring of graphs
@@ Property / cites work: Star coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on a paper by Vizing on critical graphs
+Normal rank
@@ Property / cites work @@
+The list chromatic index of a bipartite multigraph
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3752419
@@ Property / cites work: Q3752419 / rank @@
+Normal rank
@@ Property / cites work @@
+List Colouring Squares of Planar Graphs
@@ Property / cites work: List Colouring Squares of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improper choosability of graphs and maximum average degree
+Normal rank
@@ Property / cites work @@
+Largest planar graphs of diameter two and fixed maximum degree
+Normal rank
@@ Property / cites work @@
+Coloring the square of a planar graph
@@ Property / cites work: Coloring the square of a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q3807237
@@ Property / cites work: Q3807237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263585
@@ Property / cites work: Q4263585 / rank @@
+Normal rank
@@ Property / cites work @@
+Light subgraphs of graphs embedded in the plane. A survey
+Normal rank
@@ Property / cites work @@
+Graphs of degree 4 are 5-edge-choosable
@@ Property / cites work: Graphs of degree 4 are 5-edge-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Q4511485
@@ Property / cites work: Q4511485 / rank @@
+Normal rank
@@ Property / cites work @@
+List Dynamic Coloring of Sparse Graphs
@@ Property / cites work: List Dynamic Coloring of Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Counterexamples to the List Square Coloring Conjecture
+Normal rank
@@ Property / cites work @@
+Note to the paper of Grünbaum on acyclic colorings
+Normal rank
@@ Property / cites work @@
+Choosability conjectures and multicircuits
@@ Property / cites work: Choosability conjectures and multicircuits / rank @@
+Normal rank
@@ Property / cites work @@
+Ore's conjecture for \(k=4\) and Grötzsch's theorem
+Normal rank
@@ Property / cites work @@
+Nowhere-zero 3-flows and modulo \(k\)-orientations
+Normal rank
@@ Property / cites work @@
+Edge coloring of graphs with small average degrees
+Normal rank
@@ Property / cites work @@
+On the size of critical graphs with maximum degree 8
+Normal rank
@@ Property / cites work @@
+A bound on the chromatic number of the square of a planar graph
+Normal rank
@@ Property / cites work @@
+Q3424787
@@ Property / cites work: Q3424787 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424893
@@ Property / cites work: Q3424893 / rank @@
+Normal rank
@@ Property / cites work @@
+Decomposition of Finite Graphs Into Forests
@@ Property / cites work: Decomposition of Finite Graphs Into Forests / rank @@
+Normal rank
@@ Property / cites work @@
+Q3575472
@@ Property / cites work: Q3575472 / rank @@
+Normal rank
@@ Property / cites work @@
+The four-colour theorem
@@ Property / cites work: The four-colour theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Hadwiger's conjecture for \(K_ 6\)-free graphs
@@ Property / cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the three color problem
@@ Property / cites work: A note on the three color problem / rank @@
+Normal rank
@@ Property / cites work @@
+Planar graphs of maximum degree seven are Class I
@@ Property / cites work: Planar graphs of maximum degree seven are Class I / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of edge chromatic critical graphs
@@ Property / cites work: On the size of edge chromatic critical graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Coloring edges of graphs embedded in a surface of characteristic zero.
+Normal rank
@@ Property / cites work @@
+Q3139765
@@ Property / cites work: Q3139765 / rank @@
+Normal rank
@@ Property / cites work @@
+Every planar graph is 5-choosable
@@ Property / cites work: Every planar graph is 5-choosable / rank @@
+Normal rank
@@ Property / cites work @@
+Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
+Normal rank
@@ Property / cites work @@
+-list-coloring planar graphs of girth 5
@@ Property / cites work: 3-list-coloring planar graphs of girth 5 / rank @@
+Normal rank
@@ Property / cites work @@
+A short list color proof of Grötzsch's theorem
@@ Property / cites work: A short list color proof of Grötzsch's theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Star coloring high girth planar graphs
@@ Property / cites work: Star coloring high girth planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5558480
@@ Property / cites work: Q5558480 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4517442
@@ Property / cites work: Q4517442 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5564127
@@ Property / cites work: Q5564127 / rank @@
+Normal rank
@@ Property / cites work @@
+List colourings of planar graphs
@@ Property / cites work: List colourings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a planar graph to be class I
+Normal rank
@@ Property / cites work @@
+Choosability and edge choosability of planar graphs without five cycles
+Normal rank
@@ Property / cites work @@
+A sufficient condition for a plane graph with maximum degree 6 to be class 1
+Normal rank
@@ Property / cites work @@
+The average degree of an edge‐chromatic critical graph II
+Normal rank
@@ Property / cites work @@
+The average degree of a multigraph critical with respect to edge or total choosability
+Normal rank
@@ Property / cites work @@
+Q4248536
@@ Property / cites work: Q4248536 / rank @@
+Normal rank
@@ Property / cites work @@
+The linear arboricity of planar graphs of maximum degree seven is four
+Normal rank
@@ Property / cites work @@
+Coloring the square of a sparse graph \(G\) with almost \(\varDelta(G)\) colors
+Normal rank
@@ Property / cites work @@
+Every planar graph with maximum degree 7 is of class 1
+Normal rank
@@ Property / cites work @@
+Edge choosability of planar graphs without small cycles
+Normal rank
@@ Property / cites work @@
+Circular chromatic number: A survey
@@ Property / cites work: Circular chromatic number: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q3424895
@@ Property / cites work: Q3424895 / rank @@
+Normal rank