Recommendations
Cites work
Cited in
(51)- Lexicographic product graphs \(P_m[P_n]\) are antimagic
- A generalized version of a local antimagic labelling conjecture
- Antimagicness of lexicographic product graph \(G[P_n]\)
- Local antimagic orientation of graphs
- Vertex coloring of a graph for memory constrained scenarios
- On local antimagic chromatic number of cycle-related join graphs
- Affirmative solutions on local antimagic chromatic number
- Local antimagic labeling of graphs
- On join product and local antimagic chromatic number of regular graphs
- On local antimagic chromatic number of lexicographic product graphs
- On graceful antimagic graphs
- Proof of a local antimagic conjecture
- On local antimagic chromatic number of graphs
- On local super antimagic total face coloring and the application in developing a cipher block chaining key
- Local antimagic chromatic number of trees - I
- Local antimagic chromatic number for the corona product of wheel and null graphs
- On local edge antimagic chromatic number of graphs
- On modulo local antimagic chromatic number of graphs
- On number of pendants in local antimagic chromatic number
- Chromatic number of super vertex local antimagic total labelings of graphs
- Local vertex antimagic chromatic number of some wheel related graphs
- On Local Antimagic Vertex Coloring for Complete Full t-ary Trees
- On $(a,d)$-edge local antimagic coloring number of graphs
- Local irregular vertex coloring of some families graph
- On the local antimagic chromatic number of the lexicographic product of graphs
- On the set chromatic number of the middle graph of extended stars and related tree families
- Local irregular vertex coloring of comb product by path graph and star graph
- Every graph is local antimagic total and its applications
- On local antimagic chromatic number of various join graphs
- On local antimagic total labeling of complete graphs amalgamation
- Approaches that output infinitely many graphs with small local antimagic chromatic number
- On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
- Local distance antimagic chromatic number for the union of star and double star graphs
- Graph antimagic labeling: a survey
- Local distance antimagic chromatic number for the union of complete bipartite graphs
- On local antimagic chromatic number of cycle-related join graphs. II
- A note on local edge antimagic chromatic number of graphs
- On local distance antimagic chromatic number of graphs disjoint union with 1-regular graphs
- On local antimagic chromatic number of graphs with cut-vertices
- Complete characterization of bridge graphs with local antimagic chromatic number 2
- On local distance antimagic labeling of graphs
- On local antimagic chromatic numbers of the join of two special families of graphs
- Local distance antimagic cromatic number of join product of graphs with cycles or paths
- Complete solutions on local antimagic chromatic number of three families of disconnected graphs
- On local antimagic chromatic number of the join of two special families of graphs. II
- The vertex local antimagicness for Knödel and Fibonacci graphs
- Local edge antimagic chromatic number of comb products involving path graph
- On the study of rainbow antimagic connection number of comb product of tree and complete bipartite graph
- Complete characterization of graphs with local total antimagic chromatic number 3
- Local antimagic labeling of cycle-related graphs for communication channel optimization in wireless sensor networks
- On local antimagic chromatic number of three disjoint cycles
This page was built for publication: Local antimagic vertex coloring of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014210)
