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

DOI10.1007/S10878-012-9569-5zbMATH Open1337.90077OpenAlexW2011298123MaRDI QIDQ489739FDOQ489739

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

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

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)

Cites Work

• Adjacent strong edge coloring of graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• Adjacent Vertex Distinguishing Edge‐Colorings
• 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 neighbour-distinguishing index of a graph
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs

Cited In (16)

• Title not available (Why is that?)
• The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• Proper distinguishing colorings with few colors for graphs with girth at least 5
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• Title not available (Why is that?)
• Adjacent vertex distinguishing edge coloring of planar graphs with girth at least 6
• Some bounds on the neighbor-distinguishing index of graphs
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• Upper bounds for adjacent vertex-distinguishing edge coloring
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Distinguishing colorings of 3-connected planar graphs with five colors

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)