A note on adjacent vertex distinguishing colorings of graphs
From MaRDI portal
Publication:266908
DOI10.1016/J.DAM.2015.12.005zbMATH Open1333.05101OpenAlexW2197029896MaRDI QIDQ266908FDOQ266908
Authors: Maria Axenovich, Jochen Harant, Jakub Przybyło, Roman Soták, Margit Voigt, J. Weidelich 
Publication date: 7 April 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.12.005
Recommendations
- On the adjacent vertex distinguishing edge colourings of graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Adjacent vertex distinguishing total coloring of a class of graphs
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs
- Some new results on the adjacent vertex-distinguishing total coloring of graphs
- scientific article; zbMATH DE number 6843221
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs
- Adjacent vertex-distinguishing edge coloring of graphs
- Adjacent vertex-distinguishing total colorings of graphs with constraint conditions
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- On vertex-coloring 13-edge-weighting
- A new upper bound for the total vertex irregularity strength of graphs
- A dynamic survey of graph labeling
- Edge weights and vertex colours
- Symmetry breaking in graphs
- Vertex-colouring edge-weightings
- General neighbour-distinguishing index of a graph
- Degree constrained subgraphs
- The difference between consecutive primes. II
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor-distinguishing vertex colorings of graphs
- An introduction to the theory of numbers. Edited and revised by D. R. Heath-Brown and J. H. Silverman. With a foreword by Andrew Wiles
- On a \(1,2\) conjecture
- Neighbor sum distinguishing index
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A note on vertex colorings of plane graphs
- On graph irregularity strength
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Irregularity strength of dense graphs
- Entire colouring of plane graphs
- Additive coloring of planar graphs
- On irregular total labellings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Lucky labelings of graphs
Cited In (18)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- A note on vertex colorings of plane graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a total version of 1-2-3 conjecture
- Title not available (Why is that?)
- AVD proper edge-coloring of some families of graphs
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- The \(k\)-strong induced arboricity of a graph
- A note on additive choice number of planar graphs
- Additive list coloring of planar graphs with given girth
- A lower bound and several exact results on the \(d\)-lucky number
- Planar graphs with girth 20 are additively 3-choosable
- Colourings of graphs by labellings
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- Sum-distinguishing number of sparse hypergraphs
- Adjacent vertex-distinguishing proper edge-coloring of strong product of graphs
- An Alon-Tarsi style theorem for additive colorings
This page was built for publication: A note on adjacent vertex distinguishing colorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q266908)
