Adjacent vertex-distinguishing edge coloring of graphs
From MaRDI portal
Publication:5419983
Recommendations
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On the adjacent vertex distinguishing edge chromatic number of graphs.
- Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
Cited in
(27)- scientific article; zbMATH DE number 2186062 (Why is no real title available?)
- scientific article; zbMATH DE number 7594599 (Why is no real title available?)
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph.
- On generalisations of the AVD conjecture to digraphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- On the neighbor-distinguishing indices of planar graphs
- On the inclusion chromatic index of a graph
- The AVD-edge-coloring conjecture for some split graphs
- AVD-edge coloring on powers of paths
- Adjacent vertex distinguishing edge coloring of IC-planar graphs
- scientific article; zbMATH DE number 7070753 (Why is no real title available?)
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- scientific article; zbMATH DE number 5629882 (Why is no real title available?)
- Progress on the adjacent vertex distinguishing edge coloring conjecture
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
- On inducing degenerate sums through 2-labellings
- On the neighbor sum distinguishing index of planar graphs
- Coloring squares of graphs with mad constraints
- A note on adjacent vertex distinguishing colorings of graphs
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- scientific article; zbMATH DE number 6453552 (Why is no real title available?)
- On the adjacent vertex distinguishing edge colourings of graphs
- On the adjacent vertex distinguishing edge chromatic number of graphs.
This page was built for publication: Adjacent vertex-distinguishing edge coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5419983)