On the public citation graph
The minimality of the mycielski graph
0 signed · 40 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/978-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/bf01894680openalex-snapshot
On chromatic number of finite set-systems
inferredcites →https://doi.org/10.1016/s0021-9800(70)80057-6openalex-snapshot
The smallest triangle-free 4-chromatic 4-regular graph
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
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.20007openalex-snapshot
Dependent edges in Mycielski graphs and 4‐colorings of 4‐skeletons
inferred← citeshttps://doi.org/10.1002/jgt.22467openalex-snapshot
On minimal triangle‐free 6‐chromatic graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-39219-2_16openalex-snapshot
Smallest $$C_{2l+1}$$-Critical Graphs of Odd-Girth $$2k+1$$
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_29openalex-snapshot
Large Independent Sets in Triangle-Free Planar Graphs
inferred← citeshttps://doi.org/10.1007/bfb0070370openalex-snapshot
On graphs having prescribed clique number, chromatic number, and maximum degree
inferred← citeshttps://doi.org/10.1007/s00373-020-02243-zopenalex-snapshot
Questions on Color-Critical Subgraphs
inferred← citeshttps://doi.org/10.1007/s00373-023-02654-8openalex-snapshot
On Some Generalized Vertex Folkman Numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2008.06.027openalex-snapshot
Partitioning graphs into complete and empty graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2010.08.013openalex-snapshot
On minimal triangle-free graphs with prescribed k -defective chromatic number
inferred← citeshttps://doi.org/10.1016/j.disc.2014.08.010openalex-snapshot
On degree sums of a triangle-free graph
inferred← citeshttps://doi.org/10.1016/j.endm.2016.05.021openalex-snapshot
The first and the second Zagreb indices of the generalized Mycielskian of graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2012.06.001openalex-snapshot
The chromatic gap and its extremes
inferred← citeshttps://doi.org/10.1016/j.jmaa.2019.06.069openalex-snapshot
On atom-bond connectivity index of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00134-1openalex-snapshot
On the triangle vertex Folkman numbers
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)89267-9openalex-snapshot
On the NP-completeness of the k-colorability problem for triangle-free graphs
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70391-1openalex-snapshot
The State of the Three Color Problem
inferred← citeshttps://doi.org/10.1090/s0002-9939-1978-0476560-xopenalex-snapshot
On the genus of graphs with Lick-White number 𝑘
inferred← citeshttps://doi.org/10.1137/07067920xopenalex-snapshot
Coloring of Triangle-Free Graphs on the Double Torus
inferred← citeshttps://doi.org/10.11606/d.45.2018.tde-10092018-175741openalex-snapshot
Grafos e hipergrafos com cintura e número cromático grandes
inferred← citeshttps://doi.org/10.11606/t.45.2019.tde-15032019-114236openalex-snapshot
Densidade local em grafos
inferred← citeshttps://doi.org/10.2298/fil1206215hopenalex-snapshot
More on Zagreb coindices of graphs
inferred← citeshttps://doi.org/10.23638/dmtcs-21-3-9openalex-snapshot
Bounds for the smallest $k$-chromatic graphs of given girth
inferred← citeshttps://doi.org/10.26493/2590-9770.1737.0f8openalex-snapshot
On (r,g,χ)- graphs and cages of regularity r, girth g and chromatic number χ
inferred← citeshttps://doi.org/10.37236/1626openalex-snapshot
Computation of the Vertex Folkman Numbers $F(2,2,2,4;6)$ and $F(2,3,4;6)$
inferred← citeshttps://doi.org/10.47443/dml.2021.s107openalex-snapshot
On 4-colorable robust critical graphs
inferred← citeshttps://doi.org/10.48550/arxiv.0903.3151openalex-snapshot
On The Vertex Folkman Numbers $F_v(\underbrace{2,...,2}_r;r-1)$ and $F_v(\underbrace{2,...,2}_r;r-2)$%
inferred← citeshttps://doi.org/10.48550/arxiv.0903.3812openalex-snapshot
On the Vertex Folkman Numbers $F_v(2,...,2;q)$
inferred← citeshttps://doi.org/10.48550/arxiv.1002.4332openalex-snapshot
Chromatic number of graphs and edge Folkman numbers
inferred← citeshttps://doi.org/10.48550/arxiv.1503.08444openalex-snapshot
The vertex Folkman numbers $F_v(a_1, ..., a_s; m - 1) = m + 9$, if $\max\{a_1, ..., a_s\} = 5$
inferred← citeshttps://doi.org/10.48550/arxiv.1911.09799openalex-snapshot
An algebraic reduction of Hedetniemi's conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.2103.05816openalex-snapshot
Characterization of Graphs with Villainy 2
inferred← citeshttps://doi.org/10.5614/ejgta.2022.10.2.19openalex-snapshot
Eternal domination and clique covering
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.