On the public citation graph

Locally Identifying Coloring of Graphs

0 signed · 33 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/(sici)1097-0118(199710)26:2<73::aid-jgt2>3.0.co;2-copenalex-snapshot
Vertex-distinguishing proper edge-colorings
inferredcites →https://doi.org/10.1002/jgt.10076openalex-snapshot
Vertex‐distinguishing edge colorings of graphs
inferredcites →https://doi.org/10.1002/jgt.20061openalex-snapshot
Semistrong edge coloring of graphs
inferredcites →https://doi.org/10.1007/10692760_1openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
inferredcites →https://doi.org/10.1007/s002249910009openalex-snapshot
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
inferredcites →https://doi.org/10.1016/j.disc.2004.12.027openalex-snapshot
r-Strong edge colorings of graphs
inferredcites →https://doi.org/10.1016/j.disc.2012.01.034openalex-snapshot
Locally identifying colourings for graphs with given maximum degree
inferredcites →https://doi.org/10.1016/j.jctb.2005.04.002openalex-snapshot
Δ+300 is a bound on the adjacent vertex distinguishing edge chromatic number
inferredcites →https://doi.org/10.1016/s0012-365x(01)00387-9openalex-snapshot
The observability of the Fibonacci and the Lucas cubes
inferredcites →https://doi.org/10.1016/s0012-365x(96)00292-0openalex-snapshot
Asymptotic behaviour of the observability of Qn
inferredcites →https://doi.org/10.1016/s0893-9659(02)80015-5openalex-snapshot
Adjacent strong edge coloring of graphs
inferredcites →https://doi.org/10.1090/s0894-0347-1992-1135027-1openalex-snapshot
The Even Cycle Problem for Directed Graphs
inferredcites →https://doi.org/10.1137/1.9780898719796openalex-snapshot
Graph Classes: A Survey
inferredcites →https://doi.org/10.1145/1377676.1377734openalex-snapshot
Polychromatic colorings of plane graphs
inferredcites →https://doi.org/10.1145/49097.49099openalex-snapshot
Planar NAE3SAT is in P
inferredcites →https://doi.org/10.3934/amc.2008.2.403openalex-snapshot
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-030-51117-3_8openalex-snapshot
Locating-Domination and Identification
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_11openalex-snapshot
On Locally Identifying Coloring of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-25211-2_9openalex-snapshot
New Bounds and Constructions for Neighbor-Locating Colorings of Graphs
inferred← citeshttps://doi.org/10.1007/s00373-016-1677-zopenalex-snapshot
Relaxed Locally Identifying Coloring of Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2013.07.003openalex-snapshot
Locally identifying coloring in bounded expansion classes of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.10.028openalex-snapshot
On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.07.002openalex-snapshot
A Vizing-like theorem for union vertex-distinguishing edge coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2024.07.046openalex-snapshot
On locally identifying coloring of Cartesian product and tensor product of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.10.015openalex-snapshot
Locally identifying coloring of graphs with few P4s
inferred← citeshttps://doi.org/10.1142/s1793830925500521openalex-snapshot
Locally identifying coloring of strong product of graphs
inferred← citeshttps://doi.org/10.21711/231766362023/rmc5517openalex-snapshot
Locally identifying coloring in some chordal graphs
inferred← citeshttps://doi.org/10.22215/etd/2012-09573openalex-snapshot
Derived colourings of graphs
inferred← citeshttps://doi.org/10.5753/etc.2023.230766openalex-snapshot
Coloração de identificação local em produto Cartesiano
inferred← citeshttps://doi.org/10.5753/etc.2024.3089openalex-snapshot
Coloração de identificação local no produto corona de ciclos e caminhos
inferred← citeshttps://doi.org/10.5753/etc.2026.23412openalex-snapshot
Coloração de identificação local em grafos split-comparabilidade
inferred← citeshttps://doi.org/10.5821/dissertation-2117-96089openalex-snapshot
Random combinatorial structures with low dependencies : existence and enumeration
inferred← citeshttps://doi.org/10.70675/ad0325a2zac94z4825z926dz7f1ac4ce2b33openalex-snapshot
Criticalité, identification et jeux de suppression de sommets dans les graphes : Des étoiles plein les jeux
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.