On the public citation graph
Graphs with Large Distinguishing Chromatic Number
0 signed · 22 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/s004930100016openalex-snapshot
Ramsey-type Theorems with Forbidden Subgraphs
inferredcites →https://doi.org/10.1016/j.disc.2009.04.004openalex-snapshot
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results
inferredcites →https://doi.org/10.1016/j.disc.2009.11.021openalex-snapshot
The distinguishing chromatic number of Cartesian products of two complete graphs
inferredcites →https://doi.org/10.1016/j.disc.2010.12.013openalex-snapshot
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
inferredcites →https://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1137/080728640openalex-snapshot
Breaking the Symmetries of the Book Graph and the Generalized Petersen Graph
inferredcites →https://doi.org/10.37236/165openalex-snapshot
Distinguishing Chromatic Numbers of Bipartite Graphs
inferredcites →https://doi.org/10.37236/177openalex-snapshot
Bounds on the Distinguishing Chromatic Number
inferredcites →https://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00009-023-02410-5openalex-snapshot
On the Comparison of the Distinguishing Coloring and the Locating Coloring of Graphs
inferred← citeshttps://doi.org/10.1016/j.amc.2015.02.014openalex-snapshot
Bicyclic oriented graphs with skew-rank 2 or 4
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.1016/j.ejc.2015.12.005openalex-snapshot
Relation between the skew-rank of an oriented graph and the rank of its underlying graph
inferred← citeshttps://doi.org/10.1016/j.laa.2016.01.036openalex-snapshot
Skew-rank of an oriented graph in terms of matching number
inferred← citeshttps://doi.org/10.1016/j.laa.2018.04.032openalex-snapshot
On the relationship between the skew-rank of an oriented graph and the rank of its underlying graph
inferred← citeshttps://doi.org/10.1080/03081087.2015.1077776openalex-snapshot
Skew-rank of an oriented graph with edge-disjoint cycles
inferred← citeshttps://doi.org/10.1080/03081087.2017.1374327openalex-snapshot
On the relation between theH-rank of a mixed graph and the matching number of its underlying graph
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.7151/dmgt.2162openalex-snapshot
Trees with distinguishing index equal distinguishing number plus one
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.