Adjacent vertex-distinguishing edge coloring of graphs
From MaRDI portal
Publication:5419983
zbMATH Open1291.05055MaRDI QIDQ5419983FDOQ5419983
Authors: Marthe Bonamy, Hervé Hocquard, Nicolas Bousquet
Publication date: 11 June 2014
Recommendations
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- 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)
- On the algorithmic complexity of determining the AVD and NSD chromatic indices of graphs
- A note on adjacent vertex distinguishing colorings of graphs
- On the neighbor sum distinguishing index of planar graphs
- Progress on the adjacent vertex distinguishing edge coloring conjecture
- On the neighbor-distinguishing indices of planar graphs
- AVD-edge coloring on powers of paths
- On inducing degenerate sums through 2-labellings
- Coloring squares of graphs with mad constraints
- Title not available (Why is that?)
- Adjacent vertex distinguishing edge coloring of IC-planar graphs
- On the inclusion chromatic index of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Title not available (Why is that?)
- 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 the adjacent vertex distinguishing edge chromatic number of graphs.
- Title not available (Why is that?)
- The AVD-edge-coloring conjecture for some split graphs
- On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
- On the adjacent vertex distinguishing edge colourings of graphs
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
- On generalisations of the AVD conjecture to digraphs
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)