On the public citation graph
Painting Squares in $\Delta^2-1$ Shades
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-0037(199708)30:1<73::aid-net8>3.0.co;2-iopenalex-snapshot
Introduction to graph theory
inferredcites →https://doi.org/10.1002/jgt.20273openalex-snapshot
List‐coloring the square of a subcubic graph
inferredcites →https://doi.org/10.1002/net.3230100109openalex-snapshot
Maximum degree in graphs of diameter 2
inferredcites →https://doi.org/10.1007/bf01204715openalex-snapshot
Colorings and orientations of graphs
inferredcites →https://doi.org/10.1007/s10114-014-3238-9openalex-snapshot
The distance coloring of graphs
inferredcites →https://doi.org/10.1016/0095-8956(77)90037-5openalex-snapshot
On an upper bound of a graph's chromatic number, depending on the graph's degree and density
inferredcites →https://doi.org/10.1016/j.disc.2014.01.024openalex-snapshot
Brooks’ theorem on powers of graphs
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1109/swct.1964.27openalex-snapshot
Topological constraints on interconnection-limited logic
inferredcites →https://doi.org/10.1137/110827879openalex-snapshot
A Fractional Analogue of Brooks' Theorem
inferredcites →https://doi.org/10.1142/9789812796936_0038openalex-snapshot
On Moore Graphs with Diameters 2 and 3
inferredcites →https://doi.org/10.17877/de290r-16496openalex-snapshot
Graphs with given diameter and a coloring problem
inferredcites →https://doi.org/10.37236/285openalex-snapshot
Flexible Color Lists in Alon and Tarsi's Theorem, and Time Scheduling with Unreliable Participants
inferredcites →https://doi.org/10.37236/35openalex-snapshot
Moore Graphs and Beyond: A survey of the Degree/Diameter Problem
inferredcites →https://doi.org/10.37236/448openalex-snapshot
A Paintability Version of the Combinatorial Nullstellensatz, and List Colorings of $k$-partite $k$-uniform Hypergraphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.011openalex-snapshot
Relaxation of Wegner's Planar Graph Conjecture for Maximum Degree 4
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113405openalex-snapshot
2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103822openalex-snapshot
A Brooks-like result for graph powers
inferred← citeshttps://doi.org/10.1137/22m1492623openalex-snapshot
Square Coloring Planar Graphs with Automatic Discharging
inferred← citeshttps://doi.org/10.70675/22dd7305zb552z431fza392zbc8e233f69dfopenalex-snapshot
Induction Schemes : From Language Separation to Graph Colorings
inferred← citeshttps://doi.org/10.70675/8e7a61e9zd01dz4d94z9986z78191e839a01openalex-snapshot
2-distance coloring of sparse graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2472openalex-snapshot
Coloring squares of planar graphs with small maximum degree
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.