On the public citation graph
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
0 signed · 24 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.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1016/s0304-0208(08)73437-6openalex-snapshot
Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
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-540-32439-3_9openalex-snapshot
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey
inferred← citeshttps://doi.org/10.1007/bf01215921openalex-snapshot
On the minimal number of edges in color-critical graphs
inferred← citeshttps://doi.org/10.1007/s00493-009-2267-yopenalex-snapshot
On the edge-density of 4-critical graphs
inferred← citeshttps://doi.org/10.1007/s00493-016-3584-6openalex-snapshot
Edge Lower Bounds for List Critical Graphs, Via Discharging
inferred← citeshttps://doi.org/10.1016/0012-365x(89)90210-0openalex-snapshot
On constructive methods in the theory of colour-critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2011.12.014openalex-snapshot
Graphs with chromatic number close to maximum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.010openalex-snapshot
On almost (k−1) -degenerate (k+1) -chromatic graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2008.06.007openalex-snapshot
Ore-type versions of Brooks' theorem
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.05.002openalex-snapshot
Ore's conjecture on color-critical graphs is almost true
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00063-5openalex-snapshot
Path partition number in tough graphs
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70310-8openalex-snapshot
On Constructive Methods in the Theory of Colour-Critical Graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70476-xopenalex-snapshot
Colour-Critical Graphs with Vertices of Low Valency
inferred← citeshttps://doi.org/10.1137/07067920xopenalex-snapshot
Coloring of Triangle-Free Graphs on the Double Torus
inferred← citeshttps://doi.org/10.37236/11549openalex-snapshot
Various Bounds on the Minimum Number of Arcs in a $k$-Dicritical Digraph
inferred← citeshttps://doi.org/10.37236/1342openalex-snapshot
An improved bound on the minimal number of edges in color-critical graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1209.1050openalex-snapshot
Ore's Conjecture on color-critical graphs is almost true
inferred← citeshttps://doi.org/10.48550/arxiv.1602.02589openalex-snapshot
Edge Lower Bounds for List Critical Graphs, via Discharging
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.