Graph coloring methods

MaRDI QIDQ6652005zbMATH OpenFDO

Authors Daniel W. Cranston

Publication date 11 December 2024

zbMATH Keywords

combinatorial Nullstellensatzgreedy coloringkernel methodnowhere-zero flowsplanar graphspotential methodprecoloring extensionrecoloringRosenfeld countingvertex identificationvertex shuffle

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Graph Colorings
• Chromatic graph theory
• Chromatic graph theory
• Guide to graph colouring. Algorithms and applications
• A guide to graph colouring. Algorithms and applications

Cited in

(2)

• The overfull nine dragon tree conjecture is true
• A lower bound on the number of edges in DP-critical graphs

This page was built for publication: Graph coloring methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652005)