On the public citation graph

Distinguishing Chromatic Numbers of Bipartite Graphs

0 signed · 12 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.37236/1042openalex-snapshot

The Distinguishing Chromatic Number

inferredcites →https://doi.org/10.37236/1242openalex-snapshot

Symmetry Breaking in Graphs

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.akcej.2018.01.007openalex-snapshot

On the local distinguishing chromatic number

inferred← citeshttps://doi.org/10.1016/j.dam.2012.10.003openalex-snapshot

List distinguishing parameters of trees

inferred← citeshttps://doi.org/10.1016/j.dam.2018.10.034openalex-snapshot

Upper bounds on the locating chromatic number of trees

inferred← citeshttps://doi.org/10.1016/j.disc.2018.05.016openalex-snapshot

Distinguishing chromatic numbers of complements of Cartesian products of complete graphs

inferred← citeshttps://doi.org/10.26493/1855-3974.848.669openalex-snapshot

χ_D(G), |Aut(G)|, and a variant of the motion lemma

inferred← citeshttps://doi.org/10.37236/2407openalex-snapshot

Graphs with Large Distinguishing Chromatic Number

inferred← citeshttps://doi.org/10.37236/7170openalex-snapshot

Proper Distinguishing Colorings with Few Colors for Graphs with Girth at Least 5

inferred← citeshttps://doi.org/10.48550/arxiv.1111.4989openalex-snapshot

List Distinguishing Parameters of Trees

inferred← citeshttps://doi.org/10.48550/arxiv.1309.0416openalex-snapshot

Distinguishing homomorphisms of infinite graphs

inferred← citeshttps://doi.org/10.48550/arxiv.1709.10021openalex-snapshot

The distinguishing chromatic number of bipartite graphs of girth at least six

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.