On the public citation graph

On colour critical graphs

0 signed · 43 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/bf01303792openalex-snapshot
Circuits in critical graphs
inferredcites →https://doi.org/10.1007/bf01886093openalex-snapshot
Applications of product colouring
inferredcites →https://doi.org/10.1007/bf02579239openalex-snapshot
Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs
inferredcites →https://doi.org/10.1007/bf02579307openalex-snapshot
Subgraphs of colour-critical graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90045-4openalex-snapshot
On critical subgraphs of colour-critical graphs
inferredcites →https://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
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
inferredcites →https://doi.org/10.1016/s0304-0208(13)73561-8openalex-snapshot
Annals of Discrete Mathematics
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
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-29.2.143openalex-snapshot
Theorems Related To the Four Colour Conjecture
inferredcites →https://doi.org/10.1112/jlms/s1-31.4.460openalex-snapshot
Map Colour Theorems Related To the Heawood Colour Formula
inferredcites →https://doi.org/10.1112/jlms/s1-32.4.436openalex-snapshot
Map Colour Theorems Related to the Heawood Colour Formula (II)
inferredcites →https://doi.org/10.1112/jlms/s1-32.4.456openalex-snapshot
Maximal Circuits in Critical 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.1112/s0025579300003260openalex-snapshot
On circuits and subgraphs of chromatic graphs
inferredcites →https://doi.org/10.1515/crll.1964.214-215.43openalex-snapshot
On the structure of 5- and 6-chromatic abstract graphs.
inferredcites →https://doi.org/10.2307/2372652openalex-snapshot
Paths and Circuits in Critical Graphs
inferredcites →https://doi.org/10.4064/fm-40-1-42-55openalex-snapshot
The structure of k-chromatic graphs
inferredcites →https://doi.org/10.4153/cjm-1969-028-5openalex-snapshot
Sur les Ensembles de Sommets Indépendants Dans les Graphes Chromatiques Minimaux

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-0118(199705)25:1<3::aid-jgt1>3.3.co;2-vopenalex-snapshot
Open problems of Paul Erdos in graph theory
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.1007/978-3-642-39286-3_7openalex-snapshot
The History of Degenerate (Bipartite) Extremal Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/bf01299743openalex-snapshot
Note on a conjecture of toft
inferred← citeshttps://doi.org/10.1007/bf02579307openalex-snapshot
Subgraphs of colour-critical graphs
inferred← citeshttps://doi.org/10.1007/bf02579371openalex-snapshot
Independent sets ink-chromatic 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/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferred← citeshttps://doi.org/10.1016/j.disc.2008.05.021openalex-snapshot
On list critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.008openalex-snapshot
Triangle-free graphs with the maximum number of cycles
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00262-5openalex-snapshot
Dense critical and vertex-critical 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)70454-0openalex-snapshot
On Some Aspects of my Work with Gabriel Dirac
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.1016/s0167-5060(08)70513-2openalex-snapshot
An Investigation of Colour-Critical Graphs with Complements of Low Connectivity
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73437-6openalex-snapshot
Construction of Colour-Critical Graphs With Given Major-Vertex Subgraph
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.1080/16073606.1993.9631741openalex-snapshot
SOME OF MY FAVORITE SOLVED AND UNSOLVED PROBLEMS IN GRAPH THEORY
inferred← citeshttps://doi.org/10.48550/arxiv.1511.00270openalex-snapshot
Problem collection from the IML programme: Graphs, Hypergraphs, and Computing
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.