Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
From MaRDI portal
(Redirected from Publication:987498)
Recommendations
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Adjacent vertex-distinguishing edge coloring of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
Cites work
- scientific article; zbMATH DE number 140040 (Why is no real title available?)
- (d,1)-total labeling of graphs with a given maximum average degree
- Adjacent Vertex Distinguishing Edge‐Colorings
- Adjacent strong edge coloring of graphs
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- Strong edge colorings of graphs
- Vertex-distinguishing edge colorings of graphs
- Vertex-distinguishing proper edge-colorings
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- r-strong edge colorings of graphs
Cited in
(43)- Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
- The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs
- Minimum number of disjoint linear forests covering a planar graph
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
- On the neighbor sum distinguishing index of planar graphs
- Distant sum distinguishing index of graphs
- Neighbor sum distinguishing index of planar graphs
- An improved upper bound for the neighbor sum distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of sparse graphs
- Neighbor sum distinguishing index of sparse graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
- A note on asymptotically optimal neighbour sum distinguishing colourings
- A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
- Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
- Edge colorings of the direct product of two graphs
- On Neighbor-Distinguishing Index of Planar Graphs
- On the inclusion chromatic index of a graph
- The algorithm for adjacent vertex distinguishing proper edge coloring of graphs
- Two-distance vertex-distinguishing index of sparse graphs
- Adjacent vertex distinguishing total coloring of graphs with lower average degree
- Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs
- Neighbor sum distinguishing coloring of some graphs
- Neighbor sum distinguishing chromatic index of sparse graphs via the combinatorial Nullstellensatz
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Two-distance vertex-distinguishing index of sparse subcubic graphs
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
- Neighbor-sum-distinguishing edge choosability of subcubic graphs
- scientific article; zbMATH DE number 7594599 (Why is no real title available?)
- Some bounds on the neighbor-distinguishing index of graphs
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Adjacent vertex-distinguishing edge coloring of graphs with maximum degree
- d-strong edge colorings of graphs
- Neighbor-distinguishing indices of planar graphs with maximum degree ten
- Adjacent vertex distinguishing colorings by sum of sparse graphs
- On the neighbour sum distinguishing index of graphs with bounded maximum average degree
- Upper bounds for adjacent vertex-distinguishing edge coloring
- Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
- The linear 2-arboricity of sparse graphs
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph
This page was built for publication: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987498)
