On the public citation graph

The chromatic number of triangle-free graphs

https://doi.org/10.1007/bfb0067369
0 signed · 18 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.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1016/s0021-9800(70)80057-6openalex-snapshot
The smallest triangle-free 4-chromatic 4-regular graph
inferredcites →https://doi.org/10.1090/s0002-9939-1972-0291019-5openalex-snapshot
A $4$-color theorem for toroidal 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.21236/ad0705364openalex-snapshot
GRAPH THEORY
inferredcites →https://doi.org/10.4064/cm-3-2-161-162openalex-snapshot
Sur le coloriage des graphs
inferredcites →https://doi.org/10.4153/cjm-1959-003-9openalex-snapshot
Graph Theory and Probability

What points at this work

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

inferred← citeshttps://doi.org/10.1002/net.3230150108openalex-snapshot
A compilation of relations between graph invariants
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_29openalex-snapshot
On the Dichromatic Number of Surfaces
inferred← citeshttps://doi.org/10.1007/bf02018401openalex-snapshot
Chromatic number and girth
inferred← citeshttps://doi.org/10.1007/bf02018409openalex-snapshot
Some results in topological graph theory
inferred← citeshttps://doi.org/10.1007/bfb0066436openalex-snapshot
Some recent results in topological graph theory
inferred← citeshttps://doi.org/10.1016/j.jctb.2004.05.001openalex-snapshot
Three-coloring Klein bottle graphs of girth five
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476560-xopenalex-snapshot
On the genus of graphs with Lick-White number 𝑘
inferred← citeshttps://doi.org/10.1090/s0002-9939-1984-0728376-7openalex-snapshot
A Five-Color Theorem for Graphs on Surfaces
inferred← citeshttps://doi.org/10.1090/s0002-9947-97-01926-0openalex-snapshot
Coloring graphs with fixed genus and girth
inferred← citeshttps://doi.org/10.37236/10223openalex-snapshot
On the Dichromatic Number of Surfaces
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.