A note on adjacent vertex distinguishing colorings of graphs
From MaRDI portal
(Redirected from Publication:266908)
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
Cites work
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- scientific article; zbMATH DE number 3735847 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- A dynamic survey of graph labeling
- A new upper bound for the total vertex irregularity strength of graphs
- A note on vertex colorings of plane graphs
- Additive coloring of planar 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
- Degree constrained subgraphs
- Edge weights and vertex colours
- Entire colouring of plane graphs
- General neighbour-distinguishing index of a graph
- Irregularity strength of dense graphs
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Lucky labelings of graphs
- Neighbor distinguishing edge colorings via the combinatorial Nullstellensatz
- Neighbor sum distinguishing index
- Neighbor-distinguishing vertex colorings of graphs
- On a \(1,2\) conjecture
- On graph irregularity strength
- On irregular total labellings
- On vertex-coloring 13-edge-weighting
- Symmetry breaking in graphs
- The difference between consecutive primes. II
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
Cited in
(18)- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- A note on vertex colorings of plane graphs
- scientific article; zbMATH DE number 6501057 (Why is no real title available?)
- scientific article; zbMATH DE number 7132838 (Why is no real title available?)
- On a total version of 1-2-3 conjecture
- scientific article; zbMATH DE number 5629882 (Why is no real title available?)
- 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)
