On the public citation graph
Some recent results in topological graph theory
0 signed · 97 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01109925openalex-snapshot
Die toroidale Dicke des vollst�ndigen Graphen
inferredcites →https://doi.org/10.1007/bf01303685openalex-snapshot
The chromatic number of a class of pseudo-2-manifolds
inferredcites →https://doi.org/10.1007/bf02960735openalex-snapshot
Über drei kombinatorische Probleme amn-dimensionalen Würfel und Würfelgitter
inferredcites →https://doi.org/10.1007/bf02992822openalex-snapshot
Thickness and coarseness of graphs
inferredcites →https://doi.org/10.1007/bf02993245openalex-snapshot
Das Geschlecht des vollständigen paaren Graphen
inferredcites →https://doi.org/10.1007/bf02996313openalex-snapshot
Ein Sechsfarbenproblem auf der Kugel
inferredcites →https://doi.org/10.1007/bfb0060104openalex-snapshot
A survey of packings and coverings of graphs
inferredcites →https://doi.org/10.1007/bfb0067369openalex-snapshot
The chromatic number of triangle-free graphs
inferredcites →https://doi.org/10.1016/0095-8956(71)90036-0openalex-snapshot
On the maximum genus of a graph
inferredcites →https://doi.org/10.1016/0095-8956(72)90010-xopenalex-snapshot
Décomposition de K16 en Trois Graphes Planaires
inferredcites →https://doi.org/10.1016/0095-8956(72)90042-1openalex-snapshot
A lower bound for crossing numbers of graphs with applications to Kn, Kp,q, and Q(d)
inferredcites →https://doi.org/10.1016/0097-3165(71)90024-0openalex-snapshot
On polynomials and crossing numbers of complete graphs
inferredcites →https://doi.org/10.1016/s0021-9800(67)80010-3openalex-snapshot
Die dicke des n-dimensionalen Würfel-graphen
inferredcites →https://doi.org/10.1016/s0021-9800(68)80013-4openalex-snapshot
On a problem of P. Erdös
inferredcites →https://doi.org/10.1016/s0021-9800(68)80063-8openalex-snapshot
The toroidal crossing number of the complete graph
inferredcites →https://doi.org/10.1016/s0021-9800(68)80081-xopenalex-snapshot
An inequality for the chromatic number of a graph
inferredcites →https://doi.org/10.1016/s0021-9800(69)80086-4openalex-snapshot
Uniquely colorable graphs
inferredcites →https://doi.org/10.1016/s0021-9800(69)80087-6openalex-snapshot
On uniquely colorable planar graphs
inferredcites →https://doi.org/10.1016/s0021-9800(70)80007-2openalex-snapshot
Toward a theory of crossing numbers
inferredcites →https://doi.org/10.1016/s0021-9800(70)80023-0openalex-snapshot
L'épaisseur des graphes complets K34 et K40
inferredcites →https://doi.org/10.1016/s0021-9800(70)80087-4openalex-snapshot
The crossing number of K
inferredcites →https://doi.org/10.1016/s1385-7258(61)50045-5openalex-snapshot
A theory of 3-connected graphs
inferredcites →https://doi.org/10.1017/s0013091500025645openalex-snapshot
On the Number of Crossings in a Complete Graph
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1017/s0305004100037385openalex-snapshot
On the thickness of the complete bipartite graph
inferredcites →https://doi.org/10.1017/s2040618500035097openalex-snapshot
Inequalities involving the genus of a graph and its thicknesses
inferredcites →https://doi.org/10.1073/pnas.52.3.688openalex-snapshot
THE MINIMUM NUMBER OF INTERSECTIONS IN COMPLETE GRAPHS
inferredcites →https://doi.org/10.1073/pnas.60.2.438openalex-snapshot
SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
inferredcites →https://doi.org/10.1080/00029890.1973.11993230openalex-snapshot
Crossing Number Problems
inferredcites →https://doi.org/10.1080/0025570x.1967.11975761openalex-snapshot
Remarks on the Four Color Problem; The Kempe Catastrophe
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10847-7openalex-snapshot
Additivity of the genus of a graph
inferredcites →https://doi.org/10.1090/s0002-9904-1962-10850-7openalex-snapshot
Every planar graph with nine points has a nonplanar complement
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0291019-5openalex-snapshot
A $4$-color theorem for toroidal graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0306028-7openalex-snapshot
On the Stable Crossing Number of Cubes
inferredcites →https://doi.org/10.1090/s0002-9939-1974-0345861-4openalex-snapshot
A Generalization of the 5-Color Theorem
inferredcites →https://doi.org/10.1093/oso/9780198596974.003.0005openalex-snapshot
Piecewise linear topology
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-44.1.612openalex-snapshot
The Point-Arboricity of Planar Graphs
inferredcites →https://doi.org/10.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs
inferredcites →https://doi.org/10.1112/plms/s3-7.1.161openalex-snapshot
A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
inferredcites →https://doi.org/10.2307/1969998openalex-snapshot
Obstructions to the Imbedding of a Complex in a Euclidean Space.: I. The First Obstruction
inferredcites →https://doi.org/10.4064/fm-40-1-42-55openalex-snapshot
The structure of k-chromatic graphs
inferredcites →https://doi.org/10.4064/fm-41-1-137-145openalex-snapshot
On a problem of P. Turan concerning graphs
inferredcites →https://doi.org/10.4153/cjm-1957-027-2openalex-snapshot
Short Proof of a Map-Colour Theorem
inferredcites →https://doi.org/10.4153/cjm-1965-084-2openalex-snapshot
The Thickness of the Complete Graph
inferredcites →https://doi.org/10.4153/cjm-1969-109-4openalex-snapshot
Minimal Decompositions of Complete Graphs into Subgraphs with Embeddability Properties
inferredcites →https://doi.org/10.4153/cmb-1963-026-xopenalex-snapshot
The Non-Biplanar Character of the Complete 9-Graph
inferredcites →https://doi.org/10.6028/jres.072b.023openalex-snapshot
Thickness and connectivity in graphs
inferredcites →https://doi.org/10.7146/math.scand.a-11476openalex-snapshot
A Maximal Toroidal Graph which is not a Triangulation.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22705openalex-snapshot
Edge‐maximal graphs on orientable and some nonorientable surfaces
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_182openalex-snapshot
Edge-coloring and f-coloring for various classes of graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_28openalex-snapshot
Parameterized Algorithms for Book Embedding Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-35802-0_34openalex-snapshot
Local and Union Page Numbers
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_135openalex-snapshot
Robust Connectivity of Graphs on Surfaces
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_18openalex-snapshot
On the Upward Book Thickness Problem: Combinatorial and Complexity Results
inferred← citeshttps://doi.org/10.1007/978-3-031-83864-4_16openalex-snapshot
Geometric Parameters of Bipartite Suspensions
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_18openalex-snapshot
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
inferred← citeshttps://doi.org/10.1007/bf01086177openalex-snapshot
Graph theory (algorithmic, algebraic, and metric problems)
inferred← citeshttps://doi.org/10.1007/bf02018409openalex-snapshot
Some results in topological graph theory
inferred← citeshttps://doi.org/10.1007/s11464-022-1010-5openalex-snapshot
A survey on book-embedding of planar graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(79)90017-7openalex-snapshot
On the relationship between the genus and the cardinality of the maximum matchings of a graph
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90023-xopenalex-snapshot
Joins of n-degenerate graphs and uniquely (m, n)-partitionable graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.001openalex-snapshot
Book drawings of complete bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111703openalex-snapshot
On exteriority notions in book embeddings and treewidth
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73153-0openalex-snapshot
Cartesian Products of Graphs and Their Crossing Numbers
inferred← citeshttps://doi.org/10.1080/01621459.2016.1141686openalex-snapshot
Geometric Representations of Random Hypergraphs
inferred← citeshttps://doi.org/10.1109/tit.2022.3154230openalex-snapshot
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks
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.1137/21m1417077openalex-snapshot
Robust Connectivity of Graphs on Surfaces
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.34944/dspace/4946openalex-snapshot
Geometric Representations of Random Hypergraphs
inferred← citeshttps://doi.org/10.35834/mjms/1337950501openalex-snapshot
An Annotated Bibliography on the Thickness, Outerthickness, and Arboricity of a Graph
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/9286openalex-snapshot
Locally Hamiltonian Graphs and Minimal Size of Maximal Graphs on a Surface
inferred← citeshttps://doi.org/10.4153/cjm-2017-028-0openalex-snapshot
Edge-Maximal Graphs on Surfaces
inferred← citeshttps://doi.org/10.46298/theoretics.25.25openalex-snapshot
Directed Acyclic Outerplanar Graphs Have Constant Stack Number
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05891openalex-snapshot
On the Book Thickness of 1-Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2003.12922openalex-snapshot
Embedding the Complete Expansion Graph in Books
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00820openalex-snapshot
Book embeddings of graphs and a theorem of Whitney
inferred← citeshttps://doi.org/10.7155/jgaa.00465openalex-snapshot
Data Structures and their Planar Graph Layouts
inferred← citeshttps://doi.org/10.9734/arjom/2017/33109openalex-snapshot
Topologized Hamiltonian and Complete Graph
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.