On the public citation graph

Paths and Circuits in Critical Graphs

0 signed · 56 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.1112/plms/s3-2.1.69openalex-snapshot
Some Theorems on Abstract Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1002/1097-0118(200011)35:3<193::aid-jgt4>3.0.co;2-gopenalex-snapshot
Long cycles in critical graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch1openalex-snapshot
Introduction to Graph Coloring
inferred← citeshttps://doi.org/10.1002/9781118032497.ch5openalex-snapshot
Critical Graphs
inferred← citeshttps://doi.org/10.1002/9781118032497.ch7openalex-snapshot
Sparse Graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190090302openalex-snapshot
Gabriel andrew dirac
inferred← citeshttps://doi.org/10.1002/mana.3210630135openalex-snapshot
[Russian text ignored]
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.1995.1051openalex-snapshot
Toughness and Triangle-Free Graphs
inferred← citeshttps://doi.org/10.1007/3-540-33700-8_30openalex-snapshot
On Six Problems Posed by Jarik Nešetřil
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_2openalex-snapshot
The Reduced Genus of a Multigraph
inferred← citeshttps://doi.org/10.1007/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_59openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_16openalex-snapshot
The Graph Coloring Problem: A Bibliographic Survey
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_59-1openalex-snapshot
On Coloring Problems
inferred← citeshttps://doi.org/10.1007/978-1-4614-7254-4_13openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/978-3-642-60406-5_16openalex-snapshot
Ramsey Theory in the Work of Paul Erdős
inferred← citeshttps://doi.org/10.1007/bf01192519openalex-snapshot
Some remarks on (k?1)-critical subgraphs ofk-critical graphs
inferred← citeshttps://doi.org/10.1007/bf01885700openalex-snapshot
The chromatic class of a multigraph
inferred← citeshttps://doi.org/10.1007/bf02579307openalex-snapshot
Subgraphs of colour-critical graphs
inferred← citeshttps://doi.org/10.1007/bfb0028823openalex-snapshot
On colour critical graphs
inferred← citeshttps://doi.org/10.1007/s00283-026-10523-4openalex-snapshot
Blanche Descartes and the Existence of Mathematicians
inferred← citeshttps://doi.org/10.1007/s00373-006-0649-0openalex-snapshot
Toughness in Graphs – A Survey
inferred← citeshttps://doi.org/10.1007/s00454-017-9934-3openalex-snapshot
New Construction of Graphs with High Chromatic Number and Small Clique Number
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90023-5openalex-snapshot
Some inequalities on the chromatic number of a graph
inferred← citeshttps://doi.org/10.1016/0012-365x(84)90162-6openalex-snapshot
Infinite generalized friendship graphs
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/0012-365x(90)90113-vopenalex-snapshot
Graph coloring satisfying restraints
inferred← citeshttps://doi.org/10.1016/0016-0032(70)90202-4openalex-snapshot
A practical approach to the chromatic partition problem
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
inferred← citeshttps://doi.org/10.1016/b978-0-12-289260-8.50010-8openalex-snapshot
Perfect Graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/j.aim.2011.05.001openalex-snapshot
Color-critical graphs have logarithmic circumference
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.05.003openalex-snapshot
Randomly colouring graphs (a combinatorial view)
inferred← citeshttps://doi.org/10.1016/j.disc.2017.09.013openalex-snapshot
Structure and algorithms for (cap, even hole)-free graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2024.104022openalex-snapshot
Subdivisions in dicritical digraphs with large order or digirth
inferred← citeshttps://doi.org/10.1016/s0167-5060(04)80051-7openalex-snapshot
Perfect graphs
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)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1017/s0305004100052853openalex-snapshot
Valentine convexity in n dimensions
inferred← citeshttps://doi.org/10.1080/00029890.1972.11992979openalex-snapshot
Thirteen Colorful Variations on Guthrie's Four-Color Conjecture
inferred← citeshttps://doi.org/10.1093/comjnl/19.2.182openalex-snapshot
On Various Algorithms for Estimating the Chromatic Number of a Graph
inferred← citeshttps://doi.org/10.1112/plms/s3-54.1.1openalex-snapshot
The Colouring Number
inferred← citeshttps://doi.org/10.1112/s0025579300003260openalex-snapshot
On circuits and subgraphs of chromatic graphs
inferred← citeshttps://doi.org/10.1112/s0025579300004770openalex-snapshot
Heawood's theorem and connectivity
inferred← citeshttps://doi.org/10.1137/1015072openalex-snapshot
Perfect Graphs and an Application to Optimizing Municipal Services
inferred← citeshttps://doi.org/10.11591/ijece.v13i3.pp2981-2989openalex-snapshot
A comparative analysis between two heuristic algorithms for the graph vertex coloring problem
inferred← citeshttps://doi.org/10.1201/b16132-29openalex-snapshot
Graph Coloring
inferred← citeshttps://doi.org/10.1287/inte.2022.1139openalex-snapshot
Clemson University’s Rotational Attendance Plan During COVID-19
inferred← citeshttps://doi.org/10.22214/ijraset.2019.4278openalex-snapshot
Graph coloring Parameters-A Survey
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-9openalex-snapshot
Bounds for the smallest $k$-chromatic graphs of given girth
inferred← citeshttps://doi.org/10.4153/cjm-1959-003-9openalex-snapshot
Graph Theory and Probability
inferred← citeshttps://doi.org/10.4153/cjm-2011-084-9openalex-snapshot
Uniquely D-colourable Digraphs with Large Girth
inferred← citeshttps://doi.org/10.48550/arxiv.0908.3169openalex-snapshot
Color-Critical Graphs Have Logarithmic Circumference
inferred← citeshttps://doi.org/10.70675/cae60fe0z49d9z4c30za6f1z76158ca58aa5openalex-snapshot
Coloration de graphes épars
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.