Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree

DOI10.1007/S10878-008-9178-5zbMATH Open1221.05166OpenAlexW2046587597MaRDI QIDQ987498FDOQ987498

Authors: Weifan Wang, Yiqiao Wang 

Publication date: 13 August 2010

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-008-9178-5

Recommendations

• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• 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

zbMATH Keywords

graphmaximum degreemaximum average degreeadjacent vertex distinguishing edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Adjacent strong edge coloring of graphs
• Vertex-distinguishing proper edge-colorings
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• \(r\)-strong edge colorings of graphs
• Title not available (Why is that?)
• Strong edge colorings of graphs
• (d,1)-total labeling of graphs with a given maximum average degree
• Vertex-distinguishing edge colorings of graphs
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six

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
• On the neighbor sum distinguishing index of planar graphs
• Minimum number of disjoint linear forests covering a planar graph
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• Distant sum distinguishing index of graphs
• Neighbor sum distinguishing edge colorings of sparse graphs
• Neighbor sum distinguishing index of sparse graphs
• Neighbor sum distinguishing index of planar graphs
• An improved upper bound for the neighbor sum distinguishing index of graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• A note on asymptotically optimal neighbour sum distinguishing colourings
• Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
• On Neighbor-Distinguishing Index of Planar Graphs
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Edge colorings of the direct product of two 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
• Title not available (Why is that?)
• Neighbor-sum-distinguishing edge choosability of subcubic graphs
• Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
• Some bounds on the neighbor-distinguishing index of graphs
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• \(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
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs
• 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)