On the public citation graph
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line Graphs
0 signed · 24 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.1002/(sici)1097-0118(200004)33:4<256::aid-jgt7>3.0.co;2-2openalex-snapshot
The round-up property of the fractional chromatic number for proper circular arc graphs
inferredcites →https://doi.org/10.1002/jgt.20334openalex-snapshot
Bounding χ in terms of ω and Δ for quasi‐line graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90051-2openalex-snapshot
Decomposition by clique separators
inferredcites →https://doi.org/10.1016/0020-0190(73)90029-xopenalex-snapshot
A max {m,n} algorithm for determining the graph H from its line graph G
inferredcites →https://doi.org/10.1016/0166-218x(89)90011-5openalex-snapshot
An O(n1.5) algorithm to color proper circular arcs
inferredcites →https://doi.org/10.1016/j.ejc.2007.04.014openalex-snapshot
An upper bound for the chromatic number of line graphs
inferredcites →https://doi.org/10.1016/j.jctb.2012.07.005openalex-snapshot
Claw-free graphs. VII. Quasi-line graphs
inferredcites →https://doi.org/10.1017/cbo9780511734885.008openalex-snapshot
The structure of claw-free graphs
inferredcites →https://doi.org/10.1137/s0097539792269095openalex-snapshot
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
inferredcites →https://doi.org/10.46298/dmtcs.3401openalex-snapshot
An upper bound for the chromatic number of line graphs
inferredcites →https://doi.org/10.48550/arxiv.1110.5111openalex-snapshot
Optimal antithickenings of claw-free trigraphs
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.21684openalex-snapshot
A Note on Hitting Maximum and Maximal Cliques With a Stable Set
inferred← citeshttps://doi.org/10.1002/jgt.21797openalex-snapshot
Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ
inferred← citeshttps://doi.org/10.1002/jgt.21858openalex-snapshot
A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω
inferred← citeshttps://doi.org/10.1007/s00373-014-1468-3openalex-snapshot
On Bounding the Difference of the Maximum Degree and the Clique Number
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113181openalex-snapshot
Large cliques in graphs with high chromatic number
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.028openalex-snapshot
A Local Epsilon Version of Reed's Conjecture
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.08.001openalex-snapshot
A local epsilon version of Reed's Conjecture
inferred← citeshttps://doi.org/10.1017/cbo9781139519793.018openalex-snapshot
Unsolved graph colouring problems
inferred← citeshttps://doi.org/10.1137/16m1099030openalex-snapshot
Short Fans and the 5/6 Bound for Line Graphs
inferred← citeshttps://doi.org/10.1145/2629600openalex-snapshot
Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition
inferred← citeshttps://doi.org/10.37236/2666openalex-snapshot
A Superlocal Version of Reed's Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5111openalex-snapshot
Optimal antithickenings of claw-free trigraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.03924openalex-snapshot
Short fans and the 5/6 bound for line 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.