On the public citation graph

Ahypergraph-free construction of highly chromatic graphs without short cycles

https://doi.org/10.1007/bf02124683
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.
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/zamm.19760560710openalex-snapshot
Walther/Voss, Über Kreise in Graphen. 271 Seiten. 99 Abb., Berlin 1974. VEB Deutscher Verlag der Wissenschaften. Preis 56,– M
inferredcites →https://doi.org/10.1007/bf02020444openalex-snapshot
On chromatic number of graphs and set-systems
inferredcites →https://doi.org/10.1007/bfb0066788openalex-snapshot
On chromatic number of graphs and set systems
inferredcites →https://doi.org/10.1016/0095-8956(79)90084-4openalex-snapshot
A short proof of the existence of highly chromatic hypergraphs without short cycles
inferredcites →https://doi.org/10.1111/j.1749-6632.1979.tb32819.xopenalex-snapshot
AMALGAMATION OF GRAPHS AND ITS APPLICATIONS

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(199901)30:1<1::aid-jgt1>3.0.co;2-popenalex-snapshot
Construction of uniquely H‐colorable graphs
inferred← citeshttps://doi.org/10.1006/jctb.1996.1738openalex-snapshot
Some Theorems Concerning the Star Chromatic Number of a Graph
inferred← citeshttps://doi.org/10.1007/978-3-642-39286-3_15openalex-snapshot
A Combinatorial Classic — Sparse Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.1007/bf00385813openalex-snapshot
Chromatic number of Hasse diagrams, eyebrows and dimension
inferred← citeshttps://doi.org/10.1007/s00493-013-2440-1openalex-snapshot
Critical graphs without triangles: An optimum density construction
inferred← citeshttps://doi.org/10.1007/s11083-010-9163-3openalex-snapshot
Dualities and Dual Pairs in Heyting Algebras
inferred← citeshttps://doi.org/10.1007/s11856-016-1361-2openalex-snapshot
Coloring, sparseness and girth
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00039-yopenalex-snapshot
High girth and extendability
inferred← citeshttps://doi.org/10.1017/s0963548399004022openalex-snapshot
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
inferred← citeshttps://doi.org/10.11575/cdm.v9i2.62197openalex-snapshot
A short construction of highly chromatic digraphs without short cycles
inferred← citeshttps://doi.org/10.37236/4823openalex-snapshot
A Construction of Uniquely $n$-Colorable Digraphs with Arbitrarily Large Digirth
inferred← citeshttps://doi.org/10.37236/9689openalex-snapshot
Uniquely $D$-Colourable Digraphs with Large Girth II: Simplification via Generalization
inferred← citeshttps://doi.org/10.4153/cjm-2011-084-9openalex-snapshot
Uniquely D-colourable Digraphs with Large Girth
inferred← citeshttps://doi.org/10.46298/dmtcs.349openalex-snapshot
On the maximum average degree and the incidence chromatic number of a graph
inferred← citeshttps://doi.org/10.48550/arxiv.1101.4417openalex-snapshot
Critical graphs without triangles: an optimum density construction
inferred← citeshttps://doi.org/10.48550/arxiv.1804.04787openalex-snapshot
Unavoidable Subtournaments in Tournaments with Large Chromatic Number
inferred← citeshttps://doi.org/10.7151/dmgt.2291openalex-snapshot
High girth hypergraphs with unavoidable monochromatic or rainbow edges
inferred← citeshttps://doi.org/10.7282/t3xp751jopenalex-snapshot
Games, graphs, and geometry
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.