On the public citation graph
Independence, clique size and maximum degree
0 signed · 23 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.1016/0095-8956(79)90062-5openalex-snapshot
Hajós' graph-coloring conjecture: Variations and counterexamples
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.21640openalex-snapshot
Lower Bounds on the Size of Maximum Independent Sets and Matchings in Hypergraphs of Rank Three
inferred← citeshttps://doi.org/10.1002/jgt.21993openalex-snapshot
The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3
inferred← citeshttps://doi.org/10.1007/s00454-016-9817-zopenalex-snapshot
Turán Type Results for Distance Graphs
inferred← citeshttps://doi.org/10.1007/s40840-018-00705-5openalex-snapshot
Zero Forcing in Claw-Free Cubic Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(96)00026-xopenalex-snapshot
Signed domination in regular graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2014.07.001openalex-snapshot
An improved lower bound on the independence number of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2021.01.027openalex-snapshot
On three outer-independent domination related parameters in graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.01.006openalex-snapshot
On line graphs of subcubic triangle-free graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.07.002openalex-snapshot
Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
inferred← citeshttps://doi.org/10.1134/s1064562417040135openalex-snapshot
Turán-type bounds for distance graphs
inferred← citeshttps://doi.org/10.1142/s1793830918500696openalex-snapshot
New bounds on the independence number of connected graphs
inferred← citeshttps://doi.org/10.2298/aadm1801143hopenalex-snapshot
Perfect roman domination in regular graphs
inferred← citeshttps://doi.org/10.2478/ausi-2014-0022openalex-snapshot
On vertex independence number of uniform hypergraphs
inferred← citeshttps://doi.org/10.2989/16073606.2017.1398193openalex-snapshot
Packing in regular graphs
inferred← citeshttps://doi.org/10.37236/3601openalex-snapshot
A New Lower Bound on the Independence Number of a Graph and Applications
inferred← citeshttps://doi.org/10.37236/4626openalex-snapshot
A Note on Coloring Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.6550openalex-snapshot
A note on coloring vertex-transitive graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1107openalex-snapshot
Some news about the independence number of a graph
inferred← citeshttps://doi.org/10.7151/dmgt.1335openalex-snapshot
A lower bound on the independence number of a graph in terms of degrees
inferred← citeshttps://doi.org/10.7868/s0869565217210034openalex-snapshot
ТУРАНОВСКИЕ ОЦЕНКИ ДЛЯ ДИСТАНЦИОННЫХ ГРАФОВ
inferred← citeshttps://doi.org/10.82308/16876openalex-snapshot
Claw-free graphs and two conjectures on omega, Delta, and chi
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.