Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

DOI10.1007/S10878-012-9569-5MaRDI QIDQ489739zbMATH OpenOpenAlexFDO

Authors Chengchao Yan, Danjun Huang, D. Chen, Weifan Wang

Publication date 21 January 2015

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

Full work available at URL https://doi.org/10.1007/s10878-012-9569-5

zbMATH Keywords

girthmaximum degreeplanar graphadjacent vertex distinguishing edge coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Coloring of graphs and hypergraphs (05C15)

Recommendations

• scientific article; zbMATH DE number 7594599
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11

Cites work

• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• On the neighbour-distinguishing index of a graph
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number

Cited in

(16)

• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• scientific article; zbMATH DE number 7594599 (Why is no real title available?)
• Proper distinguishing colorings with few colors for graphs with girth at least 5
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs with girth at least 6
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• scientific article; zbMATH DE number 6843221 (Why is no real title available?)
• Distinguishing colorings of 3-connected planar graphs with five colors
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• Some bounds on the neighbor-distinguishing index of graphs
• Upper bounds for adjacent vertex-distinguishing edge coloring

This page was built for publication: Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489739)