On the public citation graph

Crossings, Colorings, and Cliques

https://doi.org/10.37236/134
0 signed · 38 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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/jgt.20249openalex-snapshot
The crossing number of K 11 is 100
inferredcites →https://doi.org/10.1002/jgt.20448openalex-snapshot
Coloring plane graphs with independent crossings
inferredcites →https://doi.org/10.1007/bf01215921openalex-snapshot
On the minimal number of edges in color-critical graphs
inferredcites →https://doi.org/10.1007/bf01744433openalex-snapshot
New lower bound techniques for VLSI
inferredcites →https://doi.org/10.1007/bf02579269openalex-snapshot
On the conjecture of hajós
inferredcites →https://doi.org/10.1007/bfb0067363openalex-snapshot
Crossing numbers of graphs
inferredcites →https://doi.org/10.1007/s00454-006-1264-9openalex-snapshot
Improving the Crossing Lemma by Finding More Crossings in Sparse Graphs
inferredcites →https://doi.org/10.1007/s10107-006-0039-7openalex-snapshot
Reduction of symmetric semidefinite programs using the regular $$\ast$$ -representation
inferredcites →https://doi.org/10.1016/0095-8956(79)90062-5openalex-snapshot
Hajós' graph-coloring conjecture: Variations and counterexamples
inferredcites →https://doi.org/10.1016/j.disc.2008.07.040openalex-snapshot
Coloring graphs with crossings
inferredcites →https://doi.org/10.1016/s0012-365x(03)00317-0openalex-snapshot
A successful concept for measuring non-planarity of graphs: the crossing number
inferredcites →https://doi.org/10.1016/s0012-365x(98)00100-9openalex-snapshot
Colour-critical graphs with few edges
inferredcites →https://doi.org/10.1016/s0021-9800(70)80087-4openalex-snapshot
The crossing number of K
inferredcites →https://doi.org/10.1016/s0095-8956(02)00035-7openalex-snapshot
A new lower bound on the number of edges in colour-critical graphs and hypergraphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73484-4openalex-snapshot
Crossing-Free Subgraphs
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1070/sm1976v030n02abeh002267openalex-snapshot
THE THICKNESS OF AN ARBITRARY COMPLETE GRAPH
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
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/plms/s3-7.1.161openalex-snapshot
A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
inferredcites →https://doi.org/10.1137/100784059openalex-snapshot
5-Coloring Graphs with 4 Crossings
inferredcites →https://doi.org/10.1137/s0895480104442741openalex-snapshot
Improved Bounds for the Crossing Numbers of Km,n and Kn
inferredcites →https://doi.org/10.1201/9781315152394openalex-snapshot
Crossing Numbers of Graphs
inferredcites →https://doi.org/10.1215/ijm/1256049011openalex-snapshot
Every planar map is four colorable. Part I: Discharging
inferredcites →https://doi.org/10.1515/crll.1974.268-269.150openalex-snapshot
The number of edges in critical graphs.
inferredcites →https://doi.org/10.2307/3621640openalex-snapshot
Proofs from "The Book"
inferredcites →https://doi.org/10.26493/1855-3974.10.2d0openalex-snapshot
Chromatic number, independence ratio, and crossing number
inferredcites →https://doi.org/10.5860/choice.32-6283openalex-snapshot
Graph coloring problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_33openalex-snapshot
The Crossing Number of the Cone of a Graph
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.1137/17m1115320openalex-snapshot
The Crossing Number of the Cone of a Graph
inferred← citeshttps://doi.org/10.1155/2022/4550953openalex-snapshot
Calculating Crossing Numbers of Graphs Using Combinatorial Principles
inferred← citeshttps://doi.org/10.14418/wes01.2.346openalex-snapshot
An Accounting of Colorings of Graphs
inferred← citeshttps://doi.org/10.21711/231766362020/rmc4611openalex-snapshot
Colorings, Cliques and Relaxations of Planarity
inferred← citeshttps://doi.org/10.37236/2713openalex-snapshot
The Graph Crossing Number and its Variants: A Survey
inferred← citeshttps://doi.org/10.37236/3396openalex-snapshot
Remarks on a Conjecture of Barát and Tóth
inferred← citeshttps://doi.org/10.37236/345openalex-snapshot
Towards the Albertson Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1901.05155openalex-snapshot
A survey of graphs with known or bounded crossing numbers
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.