Live briefing
Everything about Equitable coloring
Graph coloring with equal color classes
In graph theory, an area of mathematics, an equitable coloring is an assignment of colors to the vertices of an undirected graph, in such a way thatNo two adjacent vertices have the same color, and The numbers of vertices in any two color classes differ by at most one. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Equitable coloringA 5-minute orientation
- Skim a recent paper: Equitable coloring of planar graphs with maximum degree at least eightInfluential work since 2022
- Pick up a classic book: Creating equitable classrooms through action researchThe most-reprinted book on the subject
- Read the landmark paper: Equitable ColoringCited 205 times
- Go sideways: Brooks' theoremA closely related topic
- Go sideways: Hadwiger conjecture (graph theory)A closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Equitable Coloring
Equitable Coloring and the Maximum Degree
On equitable coloring of bipartite graphs
Equitable Coloring of Trees
A fast algorithm for equitable coloring
An Ore-type theorem on equitable coloring
A list analogue of equitable coloring
Equitable and proportional coloring of trees
🆕 Influential since 2022
Equitable coloring of planar graphs with maximum degree at least eight
Structural Parameterizations for Equitable Coloring: Complexity, FPT Algorithms, and Kernelization
Equitable coloring in 1-planar graphs
Equitable Dominator Coloring of Helm-Related Graphs
On total coloring and equitable total coloring of infinite snark families
đź“š Books worth reading
Creating equitable classrooms through action researchCathy Caro-Bruce · 2007
The women of the pleasure quarterElizabeth de Sabato Swinton, Elizabeth De Sabato Swinton · 1995
Learning to teach for social justiceLinda Darling-Hammond, Jennifer French · 2002- 📕Legislative reviewLos Angeles County (Calif.). Commission on Human Relations · 1976
- 📕Memorandum submitted on behalf of the National Association for the Advancement of Colored People by Archibald H. Grimke, President of the Washington D.C. Branch, in re equitable provision for the buildings and grounds of the colored public schools of the Capital of the Nation in the Appropriation Bill for 1919National Association for the Advancement of Colored People. · 1918
New concise atlas of the world · 1984- 📕Protest & progressCalvin B. Rock · 2018
- 📕Workplace harassment lawBarbara Lindemann · 2011
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Brooks' theorem In graph theory, Brooks' theorem states a relationship between the maximum degree of a graph and its chromatic number. According to the theorem, in a connected…
- Hadwiger conjecture (graph theory) Unsolved problem in mathematics Does every graph with chromatic number k have a k-vertex complete graph as a minor? More unsolved problems in mathematics…
- Edge coloring In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color…
- Extremal graph theory Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory…
- András Hajnal András Hajnal (May 13, 1931 – July 30, 2016) was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known…
- Uniquely colorable graph In graph theory, a uniquely colorable graph is a k-chromatic graph that has only one possible (proper) k-coloring up to permutation of the colors. Equivalently…
- Dinitz theorem In combinatorics, the Dinitz theorem, formerly known as the Dinitz conjecture, is a statement about the extension of arrays to partial Latin squares, proposed…
- List coloring In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It…