Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
From MaRDI portal
Publication:3092678
DOI10.7151/dmgt.1556zbMath1229.05100OpenAlexW1994339797MaRDI QIDQ3092678
Yuehua Bu, Ko-Wei Lih, Wei Fan Wang
Publication date: 20 September 2011
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1556
Related Items
AVD proper edge-coloring of some families of graphs, Neighbor sum distinguishing index of \(K_4\)-minor free graphs, Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree, Upper bounds on vertex distinguishing chromatic indices of some Halin graphs, Neighbor sum distinguishing index of planar graphs, Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles, An improved upper bound for the neighbor sum distinguishing index of graphs, On the inclusion chromatic index of a graph, Neighbor-distinguishing indices of planar graphs with maximum degree ten, Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs, Adjacent vertex distinguishing indices of planar graphs without 3-cycles, Unnamed Item, Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five, Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\), Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree, Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs, Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles, Neighbor sum distinguishing edge colorings of sparse graphs
