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

MaRDI QIDQ2858736zbMATH OpenFDO

Authors Chengchao Yan, Danjun Huang, Weifan Wang

Publication date 19 November 2013

Published in Journal of Mathematical Study (Search for Journal in Brave)

zbMATH Keywords

girthmaximum degreeplanar graphadjacent vertex distinguishing edge-coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• scientific article; zbMATH DE number 7594599
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles

Cited in

(12)

• scientific article; zbMATH DE number 7594599 (Why is no real title available?)
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge coloring of planar graphs with girth at least 6
• Adjacent vertex distinguishing edge coloring of IC-planar graphs
• scientific article; zbMATH DE number 6843221 (Why is no real title available?)
• Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
• Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
• Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five

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

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