On the public citation graph

Partitions and Edge Colourings of Multigraphs

https://doi.org/10.37236/900
0 signed · 16 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.1002/sapm1949281148openalex-snapshot
A Theorem on Coloring the Lines of a Network
inferredcites →https://doi.org/10.1007/bf01894573openalex-snapshot
On odd circuits in chromatic graphs
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.5860/choice.32-6283openalex-snapshot
Graph coloring problems

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4494888openalex-extracted
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.22816openalex-snapshot
Enhancing the Erd\H{o}s-Lov\'asz Tihany Conjecture for line graphs of multigraphs
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.2025.114770openalex-snapshot
Some cases of the Erdős-Lovász Tihany conjecture for claw-free graphs
inferred← citeshttps://doi.org/10.37236/10772openalex-snapshot
Some Remarks on Even-Hole-Free Graphs
inferred← citeshttps://doi.org/10.37236/359openalex-snapshot
Double-Critical Graphs and Complete Minors
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.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.