On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
DOI10.1016/j.dam.2016.10.028zbMath1352.05068arXiv1611.03181OpenAlexW2560469491MaRDI QIDQ730489
Mohsen Mollahajiaghaei, Ali Dehghan
Publication date: 28 December 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03181
computational complexitycombinatorial Nullstellensatzclosed distinguishing labelinglist-closed distinguishing labelingstrong closed distinguishing labeling
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on adjacent vertex distinguishing colorings of graphs
- On strongly planar not-all-equal 3SAT
- Relaxed locally identifying coloring of graphs
- Algorithmic complexity of proper labeling problems
- Locally identifying colourings for graphs with given maximum degree
- Total weight choosability of Cartesian product of graphs
- Locally identifying coloring of graphs
- Vertex-coloring 2-edge-weighting of graphs
- Digraphs are 2-weight choosable
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A new type of edge-derived vertex coloring
- Colorings and orientations of graphs
- Edge weights and vertex colours
- An oriented version of the 1-2-3 conjecture
- Locally identifying coloring in bounded expansion classes of graphs
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs
- Bounding the weight choosability number of a graph
- Weight choosability of graphs
- On the 1-2-3-conjecture
- Sequence variations of the 1-2-3 Conjecture and irregularity strength
This page was built for publication: On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
