On the public citation graph

The Reducibility of Maps

https://doi.org/10.2307/2370276
0 signed · 81 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/9781118032497.ch6openalex-snapshot
The Conjectures of Hadwiger and Hajós
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.1006/eujc.2001.0563openalex-snapshot
Superposition and Constructions of Graphs Without Nowhere-zero k-flows
inferred← citeshttps://doi.org/10.1006/jctb.1995.1049openalex-snapshot
An Abstract Generalization of a Map Reduction Theorem of Birkhoff
inferred← citeshttps://doi.org/10.1006/jctb.1997.1750openalex-snapshot
The Four-Colour Theorem
inferred← citeshttps://doi.org/10.1007/3-540-45685-6_6openalex-snapshot
The 5 Colour Theorem in Isabelle/Isar
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-4612-2972-8_13openalex-snapshot
Kempe Chains and the Four Colour Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-03083-2_3openalex-snapshot
Epistemic Opacity and Scientific Realism and Anti-Realism
inferred← citeshttps://doi.org/10.1007/978-3-0348-7246-1_12openalex-snapshot
‘The First Step’ (1970)
inferred← citeshttps://doi.org/10.1007/978-3-322-96690-2_1openalex-snapshot
Computer-Algebra für den Ingenieur
inferred← citeshttps://doi.org/10.1007/978-3-540-24771-5_22openalex-snapshot
An Institution Isomorphism for Planar Graph Colouring
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/bf01071040openalex-snapshot
The lower bound of the number of vertices of plane critical graphs
inferred← citeshttps://doi.org/10.1007/bf03023914openalex-snapshot
The four color proof suffices
inferred← citeshttps://doi.org/10.1007/bfb0067376openalex-snapshot
On the cyclic connectivity of planar graphs
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/bfb0070363openalex-snapshot
Irreducible configurations and the four color conjecture
inferred← citeshttps://doi.org/10.1007/s00283-011-9248-xopenalex-snapshot
An American Goes to Europe: Three Letters from Oswald Veblen to George Birkhoff in 1913/1914
inferred← citeshttps://doi.org/10.1007/s00373-013-1310-3openalex-snapshot
A Note on Cyclic Connectivity and Matching Properties of Regular Graphs
inferred← citeshttps://doi.org/10.1007/s10878-012-9561-0openalex-snapshot
Linear algebraic approach to an edge-coloring result
inferred← citeshttps://doi.org/10.1016/0095-8956(75)90079-9openalex-snapshot
Inégalités nouvelles dans le problème des quatre couleurs
inferred← citeshttps://doi.org/10.1016/0095-8956(78)90010-2openalex-snapshot
A systematic approach to the determination of reducible configurations in the four-color conjecture
inferred← citeshttps://doi.org/10.1016/0095-8956(79)90038-8openalex-snapshot
An unavoidable set of configurations in planar triangulations
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/b978-0-08-016091-7.50015-6openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/b978-044482375-5/50018-3openalex-snapshot
Graph Theory
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50046-4openalex-snapshot
10.1016/b978-044488002-4/50046-4
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.011openalex-snapshot
The a -graph coloring problem
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114957openalex-snapshot
A power sum expansion for the Kromatic symmetric function
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.04.002openalex-snapshot
Planar graphs are 9/2-colorable
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00054-0openalex-snapshot
Catalan, Motzkin, and Riordan numbers
inferred← citeshttps://doi.org/10.1016/s0021-9800(68)80087-0openalex-snapshot
An introduction to chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0079-8169(08)61735-3openalex-snapshot
Bibliography
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/s0013091500007598openalex-snapshot
On the Number of Ways of Colouring a Map
inferred← citeshttps://doi.org/10.1063/1.3525112openalex-snapshot
A Victorian Age Proof of the Four Color Theorem
inferred← citeshttps://doi.org/10.1070/sm9665openalex-snapshot
Canonical geometrization of orientable $3$-manifolds defined by vector colourings of $3$-polytopes
inferred← citeshttps://doi.org/10.1080/00029890.1923.11986241openalex-snapshot
The Four-Color Problem
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/17445760.2019.1659259openalex-snapshot
Cyclic vertex-connectivity of Cartesian product graphs
inferred← citeshttps://doi.org/10.1090/conm/772/15484openalex-snapshot
𝐵-rigidity of the property to be an almost Pogorelov polytope
inferred← citeshttps://doi.org/10.1090/s0002-9904-1946-08553-5openalex-snapshot
George David Birkhoff and his mathematical work
inferred← citeshttps://doi.org/10.1090/s0002-9939-1965-0179110-1openalex-snapshot
The Chromatic Polynomial of the Truncated Icosahedron
inferred← citeshttps://doi.org/10.1090/s0002-9947-1946-0018401-4openalex-snapshot
Chromatic Polynomials
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.1134/s0081543819030064openalex-snapshot
Three-Dimensional Right-Angled Polytopes of Finite Volume in the Lobachevsky Space: Combinatorics and Constructions
inferred← citeshttps://doi.org/10.1134/s0081543822040083openalex-snapshot
Cohomological Rigidity of Families of Manifolds Associated with Ideal Right-Angled Hyperbolic 3-Polytopes
inferred← citeshttps://doi.org/10.1142/s1793042124300011openalex-snapshot
Unimodal sequences: From Isaac Newton to June Huh
inferred← citeshttps://doi.org/10.1142/s1793830925500259openalex-snapshot
Characterizations of p-groups whose power graphs satisfy certain connectivity conditions
inferred← citeshttps://doi.org/10.1145/237814.238005openalex-snapshot
Efficiently four-coloring planar graphs
inferred← citeshttps://doi.org/10.1155/2011/271987openalex-snapshot
On the Absolute Sum of ChromaticPolynomial Coefficient of Graphs
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.1515/krt-2022-0015openalex-snapshot
Philosophical Assumptions Behind the Rejection of Computer-Based Proofs
inferred← citeshttps://doi.org/10.2307/2371940openalex-snapshot
Another Reducible Edge Configuration
inferred← citeshttps://doi.org/10.2307/3027372openalex-snapshot
On the History and Solution of the Four-Color Map Problem
inferred← citeshttps://doi.org/10.3103/s0027132221020042openalex-snapshot
Theory of Families of Polytopes: Fullerenes and Pogorelov Polytopes
inferred← citeshttps://doi.org/10.3390/math6120309openalex-snapshot
Kempe-Locking Configurations
inferred← citeshttps://doi.org/10.3390/sym10030067openalex-snapshot
Construction of Fullerenes and Pogorelov Polytopes with 5-, 6- and one 7-Gonal Face
inferred← citeshttps://doi.org/10.4156/jcit.vol8.issue7.150openalex-snapshot
Study on the Four Color Theorem
inferred← citeshttps://doi.org/10.4213/sm10256openalex-snapshot
Четырехмерные гиперэллиптические многообразия, определяемые векторными раскрасками простых многогранников
inferred← citeshttps://doi.org/10.4213/sm10256eopenalex-snapshot
Hyperelliptic four-manifolds defined by vector-colourings of simple polytopes
inferred← citeshttps://doi.org/10.4213/sm9665openalex-snapshot
Каноническая геометризация ориентируемых трехмерных многообразий, определяемых векторными раскрасками трехмерных многогранников
inferred← citeshttps://doi.org/10.4213/tm4010openalex-snapshot
Трехмерные прямоугольные многогранники конечного объема в пространстве Лобачевского: комбинаторика и конструкции
inferred← citeshttps://doi.org/10.4213/tm4274openalex-snapshot
Когомологическая жесткость семейств многообразий, отвечающих трехмерным идеальным прямоугольным гиперболическим многогранникам
inferred← citeshttps://doi.org/10.48550/arxiv.0901.1255openalex-snapshot
Graph-Chromatic Implicit Relations
inferred← citeshttps://doi.org/10.48550/arxiv.0911.1587openalex-snapshot
Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1511.06872openalex-snapshot
The a-graph coloring problem
inferred← citeshttps://doi.org/10.48550/arxiv.1809.02807openalex-snapshot
The Birkhoff Diamond as Double Agent
inferred← citeshttps://doi.org/10.48550/arxiv.2002.11615openalex-snapshot
Intensive use of computing resources for dominations in grids and other combinatorial problems
inferred← citeshttps://doi.org/10.48550/arxiv.2004.04873openalex-snapshot
$B$-rigidity of the property to be an almost Pogorelov polytope
inferred← citeshttps://doi.org/10.5860/choice.42-2854bopenalex-snapshot
Handbook of graph theory
inferred← citeshttps://doi.org/10.70675/c11727e1zb28az437bzac5fz93a61a8b621aopenalex-snapshot
Intensive use of computing resources for dominations in grids and other combinatorial problems
inferred← citeshttps://doi.org/10.7155/jgaa.00433openalex-snapshot
D-resolvability of vertices in planar graphs
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.