On the public citation graph
Double-Critical Graphs and Complete Minors
0 signed · 28 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.1007/bf01848093openalex-snapshot
On the edge numbers of graphs with hadwiger number 4 and 5
inferredcites →https://doi.org/10.1007/bf01894573openalex-snapshot
On odd circuits in chromatic graphs
inferredcites →https://doi.org/10.1007/s00493-005-0019-1openalex-snapshot
Any 7-Chromatic Graphs Has K 7 Or K 4,4 As A Minor
inferredcites →https://doi.org/10.1016/0012-365x(87)90242-1openalex-snapshot
K5 is the only double-critical 5-chromatic graph
inferredcites →https://doi.org/10.1016/0095-8956(82)90046-6openalex-snapshot
The dichromatic number of a digraph
inferredcites →https://doi.org/10.1016/b978-044488002-4/50005-1openalex-snapshot
10.1016/b978-044488002-4/50005-1
inferredcites →https://doi.org/10.1016/j.disc.2008.11.016openalex-snapshot
The Erdős–Lovász Tihany conjecture for quasi-line graphs
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.37236/900openalex-snapshot
Partitions and Edge Colourings of Multigraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22060openalex-snapshot
A Relaxed Version of the Erdős–Lovász Tihany Conjecture
inferred← citeshttps://doi.org/10.1002/jgt.22216openalex-snapshot
Clique minors in double‐critical graphs
inferred← citeshttps://doi.org/10.1002/jgt.22816openalex-snapshot
Enhancing the Erd\H{o}s-Lov\'asz Tihany Conjecture for line graphs of multigraphs
inferred← citeshttps://doi.org/10.1002/rsa.20412openalex-snapshot
Fast simulation of large‐scale growth models
inferred← citeshttps://doi.org/10.1016/j.disc.2017.03.005openalex-snapshot
Double-critical graph conjecture for claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2019.05.034openalex-snapshot
Erdős–Lovász Tihany Conjecture for graphs with forbidden holes
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114770openalex-snapshot
Some cases of the Erdős-Lovász Tihany conjecture for claw-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.07.002openalex-snapshot
Maximizing proper colorings on graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.1142/s1793830922501336openalex-snapshot
On the double-critical graph conjecture
inferred← citeshttps://doi.org/10.37236/567openalex-snapshot
Complete and Almost Complete Minors in Double-Critical $8$-Chromatic Graphs
inferred← citeshttps://doi.org/10.3844/jmssp.2010.357.358openalex-snapshot
Edge Double-Critical Graphs
inferred← citeshttps://doi.org/10.4310/joc.2011.v2.n4.a6openalex-snapshot
The Erdös-Lovász Tihany conjecture and complete minors
inferred← citeshttps://doi.org/10.46298/dmtcs.2129openalex-snapshot
On graphs double-critical with respect to the colouring number
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5468openalex-snapshot
On triangles in K_r-minor free graphs
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.