On the public citation graph

Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number

https://doi.org/10.37236/2117
0 signed · 36 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/jgt.20171openalex-snapshot
Distinguishing geometric graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.02.022openalex-snapshot
Distinguishing labeling of group actions
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/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferredcites →https://doi.org/10.1134/s0081543808050106openalex-snapshot
On primitive permutation groups with nontrivial global stabilizers
inferredcites →https://doi.org/10.1137/060651392openalex-snapshot
Distinguishing Chromatic Number of Cartesian Products of Graphs
inferredcites →https://doi.org/10.1137/07068686xopenalex-snapshot
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach
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.2307/2306658openalex-snapshot
On Complementary Graphs
inferredcites →https://doi.org/10.26493/1855-3974.195.d00openalex-snapshot
Distinguishing partitions and asymmetric uniform hypergraphs
inferredcites →https://doi.org/10.35834/mjms/1316032831openalex-snapshot
Complementary Graphs and the Chromatic Number
inferredcites →https://doi.org/10.37236/1042openalex-snapshot
The Distinguishing Chromatic Number
inferredcites →https://doi.org/10.37236/1242openalex-snapshot
Symmetry Breaking in Graphs
inferredcites →https://doi.org/10.37236/177openalex-snapshot
Bounds on the Distinguishing Chromatic Number
inferredcites →https://doi.org/10.37236/1816openalex-snapshot
Distinguishing Numbers for Graphs and Groups
inferredcites →https://doi.org/10.37236/292openalex-snapshot
Distinguishing Number of Countable Homogeneous Relational Structures
inferredcites →https://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferredcites →https://doi.org/10.37236/954openalex-snapshot
Distinguishing Infinite 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.dam.2025.02.010openalex-snapshot
Hereditary Nordhaus–Gaddum graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.04.001openalex-snapshot
Split graphs and Nordhaus–Gaddum graphs
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.disc.2023.113392openalex-snapshot
Extremal decompositions for Nordhaus-Gaddum theorems
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113857openalex-snapshot
Split graphs and block representations
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferred← citeshttps://doi.org/10.1016/j.ejc.2019.103042openalex-snapshot
Nordhaus–Gaddum and other bounds for the chromatic edge-stability number
inferred← citeshttps://doi.org/10.12732/ijpam.v105i4.5openalex-snapshot
COLORABILITY OF UNITARY CAYLEY DIGRAPHS OF CYCLIC GROUPS
inferred← citeshttps://doi.org/10.14419/ijams.v4i1.5531openalex-snapshot
Operations on covering numbers of certain graph classes
inferred← citeshttps://doi.org/10.23860/diss-guillame-jean-2019openalex-snapshot
CLOSURE UNDER THE MAJORIZATION RELATION AND THE DISTINGUISHING CHROMATIC NUMBER OF CIRCULANT GRAPHS
inferred← citeshttps://doi.org/10.26493/1855-3974.2173.71aopenalex-snapshot
Nordhaus-Gaddum type inequalities for the distinguishing index
inferred← citeshttps://doi.org/10.26493/1855-3974.981.ff0openalex-snapshot
Improving upper bounds for the distinguishing index
inferred← citeshttps://doi.org/10.37236/8886openalex-snapshot
On Asymmetric Colourings of Claw-Free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1409.5871openalex-snapshot
The Sum and Product of Independence Numbers of Graphs and their Line Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.10660openalex-snapshot
Characterizations for split graphs and unbalanced split graphs
inferred← citeshttps://doi.org/10.9734/bjmcs/2016/20823openalex-snapshot
The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs
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.