On the public citation graph
On odd circuits in chromatic graphs
0 signed · 27 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/bf02020271openalex-snapshot
Maximum-Minimum Sätze über Graphen
inferredcites →https://doi.org/10.1112/jlms/s1-10.37.26openalex-snapshot
On Representatives of Subsets
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/jgt.22060openalex-snapshot
A Relaxed Version of the Erdős–Lovász Tihany Conjecture
inferred← citeshttps://doi.org/10.1002/jgt.22241openalex-snapshot
The width of quadrangulations of the projective plane
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.1007/bf01419610openalex-snapshot
On separating sets of edges in contraction-critical graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90057-4openalex-snapshot
Color-critical graphs and hypergraphs
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.dam.2023.12.005openalex-snapshot
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.11.016openalex-snapshot
The Erdős–Lovász Tihany conjecture for quasi-line graphs
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.2021.112781openalex-snapshot
Partition graphs of independence number 2 into two subgraphs with large chromatic numbers
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.37236/359openalex-snapshot
Double-Critical Graphs and Complete Minors
inferred← citeshttps://doi.org/10.37236/749openalex-snapshot
Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers
inferred← citeshttps://doi.org/10.37236/900openalex-snapshot
Partitions and Edge Colourings of Multigraphs
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.48550/arxiv.1309.1020openalex-snapshot
On the Erdös-Lovász Tihany Conjecture for Claw-Free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1604.05262openalex-snapshot
A note on the double-critical graph conjecture
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.