On the public citation graph

On the Geographical Problem of the Four Colours

https://doi.org/10.2307/2369235
0 signed · 225 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4624633openalex-extracted
Proof of four color theorem - a logical method
inferred← citeshttps://doi.org/10.1002/1097-0118(200102)36:2<105::aid-jgt5>3.0.co;2-hopenalex-snapshot
Extending colorings of locally planar graphs
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0146openalex-snapshot
Maximum Clique, Maximum Independent Set, and Graph Coloring Problems
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/9781118032497.ch2openalex-snapshot
Planar Graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.fmatteropenalex-snapshot
Front Matter
inferred← citeshttps://doi.org/10.1002/9781119008989.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1002/9781394214167.ch20openalex-snapshot
New Variation of Exam Scheduling Problem Using Graph Coloring
inferred← citeshttps://doi.org/10.1002/jgt.22500openalex-snapshot
Edge Kempe equivalence of regular graph covers
inferred← citeshttps://doi.org/10.1002/jgt.3190010304openalex-snapshot
An attempt to understand the four color problem
inferred← citeshttps://doi.org/10.1002/jgt.3190010305openalex-snapshot
A digest of the four color theorem
inferred← citeshttps://doi.org/10.1002/jgt.3190020202openalex-snapshot
A bibliographic survey of edge‐colorings
inferred← citeshttps://doi.org/10.1002/jgt.3190110205openalex-snapshot
On the equality of the grundy and ochromatic numbers of a graph
inferred← citeshttps://doi.org/10.1002/jgt.70014openalex-snapshot
χ‐Binding Functions for Squares of Convex Bipartite Graphs and Partite Testability for Bipartite Squares
inferred← citeshttps://doi.org/10.1006/jctb.1997.1750openalex-snapshot
The Four-Colour Theorem
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_185openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1007/0-387-29831-2_4openalex-snapshot
The Informal Logic of Mathematical Proof
inferred← citeshttps://doi.org/10.1007/1-4020-5034-8_8openalex-snapshot
The Informal Logic Of Mathematical Proof
inferred← citeshttps://doi.org/10.1007/3-540-36579-6_3openalex-snapshot
Register Allocation by Optimal Graph Coloring
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_18openalex-snapshot
Compiler Optimizations for Adaptive EPIC Processors
inferred← citeshttps://doi.org/10.1007/3-540-61576-8_68openalex-snapshot
Four coloring for a subset of maximal planar graphs with minimum degree five
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_253openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1007/978-1-0716-3597-1_20openalex-snapshot
A Victorian Comedy of Errors and Colorful Progress
inferred← citeshttps://doi.org/10.1007/978-1-0716-3597-1_21openalex-snapshot
Kempe–Heawood’s Five-Color Theorem and Tait’s Equivalence
inferred← citeshttps://doi.org/10.1007/978-1-0716-3597-1_22openalex-snapshot
The Four-Color Theorem
inferred← citeshttps://doi.org/10.1007/978-1-0716-3597-1_23openalex-snapshot
The Great Debate
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_59openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4471-0717-0_20openalex-snapshot
Greedy Algorithms for the Lower and Upper Chromatic Numbers
inferred← citeshttps://doi.org/10.1007/978-1-4612-2972-8_13openalex-snapshot
Kempe Chains and the Four Colour Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_1openalex-snapshot
Basic Results
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_10openalex-snapshot
Domination in Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_11openalex-snapshot
Spectral Properties of Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_2openalex-snapshot
Directed Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_3openalex-snapshot
Connectivity
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_4openalex-snapshot
Trees
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_5openalex-snapshot
Independent Sets and Matchings
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_6openalex-snapshot
Eulerian and Hamiltonian Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_7openalex-snapshot
Graph Colorings
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_8openalex-snapshot
Planarity
inferred← citeshttps://doi.org/10.1007/978-1-4614-4529-6_9openalex-snapshot
Triangulated Graphs
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_59-1openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4684-8971-2_2openalex-snapshot
Theory of Finite and Infinite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-19071-2_34-1openalex-snapshot
The Values of Mathematical Proofs
inferred← citeshttps://doi.org/10.1007/978-3-030-26176-4_5openalex-snapshot
Diameter of Colorings Under Kempe Changes
inferred← citeshttps://doi.org/10.1007/978-3-030-63072-0_4openalex-snapshot
An Incremental Search Heuristic for Coloring Vertices of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-81054-2_6openalex-snapshot
Applications and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_114openalex-snapshot
Kempe Changes in Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-89731-4_15openalex-snapshot
Beauty
inferred← citeshttps://doi.org/10.1007/978-3-031-40846-5_34openalex-snapshot
The Values of Mathematical Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-85414-9_4openalex-snapshot
Learning, Diagrams, and AI
inferred← citeshttps://doi.org/10.1007/978-3-031-90639-8_11openalex-snapshot
The Ontological Status of Works of Art
inferred← citeshttps://doi.org/10.1007/978-3-0348-7246-1_8openalex-snapshot
Beginn der Vierfarbenforschung (1947–1955)
inferred← citeshttps://doi.org/10.1007/978-3-0348-8968-1_7openalex-snapshot
La Théorie des Graphes
inferred← citeshttps://doi.org/10.1007/978-3-319-24012-1_7openalex-snapshot
Color Flipping
inferred← citeshttps://doi.org/10.1007/978-3-319-25730-3_5openalex-snapshot
Applications and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-540-32254-2_19openalex-snapshot
Psychological Validity of Schematic Proofs
inferred← citeshttps://doi.org/10.1007/978-3-540-35854-1_2openalex-snapshot
Basic Examples
inferred← citeshttps://doi.org/10.1007/978-3-540-39920-9_20openalex-snapshot
Improving Offset Assignment through Simultaneous Variable Coalescing
inferred← citeshttps://doi.org/10.1007/978-3-540-73433-8_24openalex-snapshot
A Short Survey of Automated Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-642-11957-6_9openalex-snapshot
Formal Verification of Coalescing Graph-Coloring Register Allocation
inferred← citeshttps://doi.org/10.1007/978-3-642-32278-5_9openalex-snapshot
Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-65153-3_2openalex-snapshot
Das Kartenfärbungsproblem
inferred← citeshttps://doi.org/10.1007/978-3-663-16027-4_3openalex-snapshot
Analysis Situs
inferred← citeshttps://doi.org/10.1007/978-3-7643-8621-4_10openalex-snapshot
Polyhedral Surfaces of High Genus
inferred← citeshttps://doi.org/10.1007/978-81-322-1768-8_10openalex-snapshot
Graph Coloring Problem Solution Using Modified Flocking Algorithm
inferred← citeshttps://doi.org/10.1007/978-94-011-1793-7_14openalex-snapshot
Social Processes and Proofs of Theorems and Programs
inferred← citeshttps://doi.org/10.1007/978-981-96-4745-3_3openalex-snapshot
Computer-Based Proofs of Four Color Conjecture
inferred← citeshttps://doi.org/10.1007/978-981-96-4745-3_9openalex-snapshot
Kempe Change
inferred← citeshttps://doi.org/10.1007/bf00376449openalex-snapshot
On the origins of D�nes K�nig's infinity lemma
inferred← citeshttps://doi.org/10.1007/bf01086606openalex-snapshot
Properties of the?-transformations of graphs and 2-manifolds
inferred← citeshttps://doi.org/10.1007/bf01759077openalex-snapshot
Heuristics for rapidly four-coloring large planar graphs
inferred← citeshttps://doi.org/10.1007/bf02096619openalex-snapshot
An algebraic approach to the planar coloring problem
inferred← citeshttps://doi.org/10.1007/bf02189318openalex-snapshot
There exist 6n/13 ordinary points
inferred← citeshttps://doi.org/10.1007/bf03023394openalex-snapshot
Social processes and proofs of theorems and programs
inferred← citeshttps://doi.org/10.1007/bf03023914openalex-snapshot
The four color proof suffices
inferred← citeshttps://doi.org/10.1007/bfb0069972openalex-snapshot
Le théorème du coloriage des cartes [ex-conjecture de Heawood et conjecture des quatre couleurs]
inferred← citeshttps://doi.org/10.1007/bfb0070360openalex-snapshot
200 years of graph theory — A guided tour
inferred← citeshttps://doi.org/10.1007/bfb0070363openalex-snapshot
Irreducible configurations and the four color conjecture
inferred← citeshttps://doi.org/10.1007/s00009-024-02591-7openalex-snapshot
A Topological Theory for Unoriented SL(4) Foams
inferred← citeshttps://doi.org/10.1007/s00283-017-9741-yopenalex-snapshot
Using Kempe Exchanges to Disentangle Kempe Chains
inferred← citeshttps://doi.org/10.1007/s00454-009-9171-5openalex-snapshot
Polychromatic Colorings of Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00493-021-4330-2openalex-snapshot
Kempe Equivalence Classes of Cubic Graphs Embedded on the Projective Plane
inferred← citeshttps://doi.org/10.1007/s00500-019-04278-8openalex-snapshot
Graph coloring: a novel heuristic based on trailing path—properties, perspective and applications in structured networks
inferred← citeshttps://doi.org/10.1007/s10479-013-1504-3openalex-snapshot
Repairing high school timetables with polymorphic ejection chains
inferred← citeshttps://doi.org/10.1007/s10617-008-9034-yopenalex-snapshot
Optimistic chordal coloring: a coalescing heuristic for SSA form programs
inferred← citeshttps://doi.org/10.1007/s10951-024-00815-yopenalex-snapshot
On the computation of robust examination timetables: methods and experimental results
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90196-9openalex-snapshot
The subchromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90065-7openalex-snapshot
Graphs with forbidden subgraphs
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90075-3openalex-snapshot
Triangulation a v5 séparés dans le problème des quatre couleurs
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90114-fopenalex-snapshot
Map coloring and the vector cross product
inferred← citeshttps://doi.org/10.1016/b978-0-08-016091-7.50015-6openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50004-6openalex-snapshot
History of Interactive Theorem Proving
inferred← citeshttps://doi.org/10.1016/b978-044482375-5/50018-3openalex-snapshot
Graph Theory
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.018openalex-snapshot
A survey of Nordhaus–Gaddum type relations
inferred← citeshttps://doi.org/10.1016/j.dam.2017.08.003openalex-snapshot
The geometric–arithmetic index and the chromatic number of connected graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2023.08.001openalex-snapshot
Expected polynomial-time randomized algorithm for graph coloring problem
inferred← citeshttps://doi.org/10.1016/j.disc.2004.07.031openalex-snapshot
Reformulating the map color theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2014.02.014openalex-snapshot
Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103802openalex-snapshot
Kempe changes in degenerate graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.08.002openalex-snapshot
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.12.008openalex-snapshot
Hamiltonian cycles and 1-factors in 5-regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2022.10.005openalex-snapshot
On Vizing's edge colouring question
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.001openalex-snapshot
On a recolouring version of Hadwiger's conjecture
inferred← citeshttps://doi.org/10.1016/j.jmp.2021.102536openalex-snapshot
Ising formulations of some graph-theoretic problems in psychological research: Models and methods
inferred← citeshttps://doi.org/10.1016/j.jmps.2021.104295openalex-snapshot
FFT-based simulations of slip and kink bands formation in 3D polycrystals: Influence of strain gradient crystal plasticity
inferred← citeshttps://doi.org/10.1016/j.shpsa.2023.05.006openalex-snapshot
Paving the cowpath in research within pure mathematics: A medium level model based on text driven variations.
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.018openalex-snapshot
Generation of various classes of trivalent graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.05.033openalex-snapshot
Diameter of colorings under Kempe changes
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00134-1openalex-snapshot
Uncolorable mixed hypergraphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70296-6openalex-snapshot
The Subchromatic Number of a Graph
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00231-0openalex-snapshot
Graph colourings and partitions
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00236-xopenalex-snapshot
Mod 3 arithmetic on triangulated Riemann surfaces
inferred← citeshttps://doi.org/10.1017/9781108332699.006openalex-snapshot
Switching techniques for edge decompositions of graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.005openalex-snapshot
Brooks's theorem
inferred← citeshttps://doi.org/10.1017/s0956796801004051openalex-snapshot
Modular lazy search for Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1063/1.3525112openalex-snapshot
A Victorian Age Proof of the Four Color Theorem
inferred← citeshttps://doi.org/10.1073/pnas.1806370115openalex-snapshot
Reproducibility failures are essential to scientific inquiry
inferred← citeshttps://doi.org/10.1080/00029890.1923.11986241openalex-snapshot
The Four-Color Problem
inferred← citeshttps://doi.org/10.1080/00029890.1938.11990773openalex-snapshot
Some Elementary Aspects of Topology
inferred← citeshttps://doi.org/10.1080/00029890.1972.11992979openalex-snapshot
Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
inferred← citeshttps://doi.org/10.1080/00207160.2012.726712openalex-snapshot
Randomized Δ-edge colouring via exchanges of complex colours
inferred← citeshttps://doi.org/10.1080/0020739880190604openalex-snapshot
An iV‐colour theorem for sequentially constructed planar graphs with myopic colouring
inferred← citeshttps://doi.org/10.1080/0025570x.1979.11976769openalex-snapshot
Some Unsolved Problems in Plane Geometry
inferred← citeshttps://doi.org/10.1080/0025570x.1985.11977169openalex-snapshot
The Other Map Coloring Theorem
inferred← citeshttps://doi.org/10.1080/0025570x.2024.2378663openalex-snapshot
Baxter’s Theorem: A Connection Between Combinatorics and Topology
inferred← citeshttps://doi.org/10.1080/02698595.2016.1265862openalex-snapshot
Computers as a Source of A Posteriori Knowledge in Mathematics
inferred← citeshttps://doi.org/10.1080/0952813x.2014.895109openalex-snapshot
Bounding the impact of AGI
inferred← citeshttps://doi.org/10.1086/715137openalex-snapshot
Proofs, Reliable Processes, and Justification in Mathematics
inferred← citeshttps://doi.org/10.1090/s0002-9904-1973-13216-1openalex-snapshot
Boundary values in chromatic graph theory
inferred← citeshttps://doi.org/10.1090/s0002-9947-1946-0018401-4openalex-snapshot
Chromatic Polynomials
inferred← citeshttps://doi.org/10.1090/s0002-9947-1973-0319794-7openalex-snapshot
Boundary Values in the Four Color Problem
inferred← citeshttps://doi.org/10.1090/s0002-9947-2010-05092-5openalex-snapshot
An unavoidable set of $D$-reducible configurations
inferred← citeshttps://doi.org/10.1090/s1079-6762-96-00003-0openalex-snapshot
inferred← citeshttps://doi.org/10.1098/rsnr.2005.0097openalex-snapshot
Arthur Cayley FRS and the four-colour map problem
inferred← citeshttps://doi.org/10.1098/rsta.2005.1650openalex-snapshot
The challenge of computer mathematics
inferred← citeshttps://doi.org/10.1103/physrevx.10.011005openalex-snapshot
Classical Dimers on Penrose Tilings
inferred← citeshttps://doi.org/10.1109/actce66599.2025.00010openalex-snapshot
Algorithmic Application of Regularization and Modulo Operation in the Proof of the Four-color Theorem
inferred← citeshttps://doi.org/10.1109/cnmt.2009.5374615openalex-snapshot
The Application of Map-Coloring Technology to Backbone Routing System
inferred← citeshttps://doi.org/10.1109/comst.2006.283819openalex-snapshot
A survey of handover algorithms in DVB-H
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397262openalex-snapshot
Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design
inferred← citeshttps://doi.org/10.1109/iitsi.2010.158openalex-snapshot
The Research on Two Important Counter-Examples of Four-Color Problem
inferred← citeshttps://doi.org/10.1109/isce.2005.1502370openalex-snapshot
Loss-free handover for IP datacast over DVB-H networks
inferred← citeshttps://doi.org/10.1109/raics.2013.6745486openalex-snapshot
Image segmentation by intelligent clustering technique
inferred← citeshttps://doi.org/10.1109/seeda-cecnsm53056.2021.9566258openalex-snapshot
Some insights about the Uncapacitated Examination Timetabling Problem
inferred← citeshttps://doi.org/10.1109/tcad.2010.2049060openalex-snapshot
An Optimal Linear-Time Algorithm for Interprocedural Register Allocation in High Level Synthesis Using SSA Form
inferred← citeshttps://doi.org/10.1109/wiecon-ece69386.2025.11525969openalex-snapshot
Hyperparameter Tuning for GNN-Based Graph Coloring: A Case Study on PI-SAGE
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb32768.xopenalex-snapshot
THE THREE EXCLUDED CASES OF DIRAC'S MAP‐COLOR THEOREM1
inferred← citeshttps://doi.org/10.1111/j.1949-8594.1980.tb09560.xopenalex-snapshot
An Historical Encounter With The Four Color Problem
inferred← citeshttps://doi.org/10.1137/120899765openalex-snapshot
Beyond the Vizing's Bound for at Most Seven Colors
inferred← citeshttps://doi.org/10.1137/140963340openalex-snapshot
Extension to Even Triangulations
inferred← citeshttps://doi.org/10.1137/s0040585x97980476openalex-snapshot
One Probabilistic Equivalent of the Four Color Conjecture
inferred← citeshttps://doi.org/10.1142/s0218216525400024openalex-snapshot
Multi-virtual knot theory
inferred← citeshttps://doi.org/10.1142/s021926592450021xopenalex-snapshot
Independent Set, Chromatic Number, Non-Uniform Coloring of 2-Connected Outerplanar Graphs and Beyond
inferred← citeshttps://doi.org/10.1145/1289881.1289919openalex-snapshot
An optimistic and conservative register assignment heuristic for chordal graphs
inferred← citeshttps://doi.org/10.1145/1377676.1377734openalex-snapshot
Polychromatic colorings of plane graphs
inferred← citeshttps://doi.org/10.1145/1988932.1988934openalex-snapshot
Decoupled graph-coloring register allocation with hierarchical aliasing
inferred← citeshttps://doi.org/10.1145/2213977.2214060openalex-snapshot
The freezing threshold for k-colourings of a random graph
inferred← citeshttps://doi.org/10.1145/229542.229546openalex-snapshot
Iterated register coalescing
inferred← citeshttps://doi.org/10.1145/237721.237777openalex-snapshot
Iterated register coalescing
inferred← citeshttps://doi.org/10.1145/3034781openalex-snapshot
The Freezing Threshold for k -Colourings of a Random Graph
inferred← citeshttps://doi.org/10.1145/359104.359106openalex-snapshot
Social processes and proofs of theorems and programs
inferred← citeshttps://doi.org/10.1145/378795.378854openalex-snapshot
Optimal spilling for CISC machines with few registers
inferred← citeshttps://doi.org/10.1145/381694.378854openalex-snapshot
Optimal spilling for CISC machines with few registers
inferred← citeshttps://doi.org/10.1145/512950.512970openalex-snapshot
Social processes and proofs of theorems and programs
inferred← citeshttps://doi.org/10.1201/9781420040579.ch13openalex-snapshot
Register Allocation
inferred← citeshttps://doi.org/10.1201/9781420053890-13openalex-snapshot
Soft Handover Techniques for Time-Slicing-Based Broadcast Systems
inferred← citeshttps://doi.org/10.1201/9781420053890.ch13openalex-snapshot
Soft Handover Techniques for Time-Slicing-Based Broadcast Systems
inferred← citeshttps://doi.org/10.1201/b16132-3openalex-snapshot
Fundamentals of Graph Theory
inferred← citeshttps://doi.org/10.1201/b16132-5openalex-snapshot
History of Graph Theory
inferred← citeshttps://doi.org/10.1215/ijm/1498032028openalex-snapshot
Wolfgang Haken and the four-color problem
inferred← citeshttps://doi.org/10.1215/ijm/1498032032openalex-snapshot
A state calculus for graph coloring
inferred← citeshttps://doi.org/10.14418/wes01.2.346openalex-snapshot
An Accounting of Colorings of Graphs
inferred← citeshttps://doi.org/10.14488/bjopm.2020.009openalex-snapshot
A graph-based decision support system for analyzing hybrid make-to-stock/make-to-order manufacturing environments
inferred← citeshttps://doi.org/10.17771/pucrio.acad.36080openalex-snapshot
UM ESTUDO SOBRE COLORAÇÃO DE ARESTAS E COLORAÇÃO TOTAL DE GRAFOS
inferred← citeshttps://doi.org/10.2139/ssrn.5828364openalex-snapshot
Evaluating Graph Coloring Algorithms for University Course Timetabling: Welch-Powell and Backtracking Approaches
inferred← citeshttps://doi.org/10.2140/involve.2009.2.249openalex-snapshot
How false is Kempe’s proof of the Four Color Theorem? Part II
inferred← citeshttps://doi.org/10.2140/pjm.1974.55.391openalex-snapshot
Quotients of complete graphs: revisiting the Heawood map-coloring problem
inferred← citeshttps://doi.org/10.21468/scipostphys.10.2.042openalex-snapshot
Topological interpretation of color exchange invariants
inferred← citeshttps://doi.org/10.2307/1572306openalex-snapshot
The Mathematics of Map Coloring
inferred← citeshttps://doi.org/10.2307/2974790openalex-snapshot
Fermat's Last Theorem, the Four Color Conjecture, and Bill Clinton for April Fools' Day
inferred← citeshttps://doi.org/10.25236/ajms.2020.010102openalex-snapshot
Proof of four-color theorem of normal map
inferred← citeshttps://doi.org/10.26493/1855-3974.175.b78openalex-snapshot
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number
inferred← citeshttps://doi.org/10.26493/1855-3974.193.8e7openalex-snapshot
A new proof of 3-colorability of Eulerian triangulations
inferred← citeshttps://doi.org/10.26713/cma.v14i2.2215openalex-snapshot
Incident Vertex \(\pi\)-Coloring of Graphs
inferred← citeshttps://doi.org/10.31234/osf.io/2qw79openalex-snapshot
MAXIMAL CLIQUE AND GRAPH COLORING HEURISTICS FOR OVERLAPPING COMMUNITY DETECTION IN NETWORK PSYCHOMETRICS
inferred← citeshttps://doi.org/10.31234/osf.io/4udfwopenalex-snapshot
Ising formulations of some graph-theoretic problems in psychological research: models and methods
inferred← citeshttps://doi.org/10.3390/a11040052openalex-snapshot
Introduction to Reconfiguration
inferred← citeshttps://doi.org/10.3390/axioms13120827openalex-snapshot
Kekulé Structure of Angularly Connected Even Ring Systems
inferred← citeshttps://doi.org/10.3390/e23010061openalex-snapshot
New Measure of Economic Development Based on the Four-Colour Theorem
inferred← citeshttps://doi.org/10.3390/math6120309openalex-snapshot
Kempe-Locking Configurations
inferred← citeshttps://doi.org/10.37236/9214openalex-snapshot
The 2-Factor Polynomial Detects Even Perfect Matchings
inferred← citeshttps://doi.org/10.3929/ethz-a-005951186openalex-snapshot
Extremal colorings and extremal satisfiability
inferred← citeshttps://doi.org/10.3990/1.9789036558716openalex-snapshot
Edge colorings of planar graphs
inferred← citeshttps://doi.org/10.4018/978-1-4666-2661-4.ch001openalex-snapshot
Basics of Graph Theory
inferred← citeshttps://doi.org/10.4028/www.scientific.net/amm.347-350.2832openalex-snapshot
A New Method Based on Undirected Graph and Polygon Triangulation to Prove the Four-Color Theorem
inferred← citeshttps://doi.org/10.4153/cmb-1968-023-5openalex-snapshot
On Partitioning Planar Graphs
inferred← citeshttps://doi.org/10.4169/amer.math.monthly.120.08.733openalex-snapshot
Higher-Dimensional Analogues of the Map Coloring Problem
inferred← citeshttps://doi.org/10.4213/tvp295openalex-snapshot
Один вероятностный эквивалент гипотезы четырех красок
showing the first 200 of 225 · page through all 225
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.