Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
From MaRDI portal
Publication:2858736
zbMATH Open1289.05108MaRDI QIDQ2858736FDOQ2858736
Authors: Chengchao Yan, Danjun Huang, Weifan Wang 
Publication date: 19 November 2013
Published in: Journal of Mathematical Study (Search for Journal in Brave)
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (12)
- Title not available (Why is that?)
- Smarandachely adjacent-vertex-distinguishing proper edge coloring of \(\overline{K}_4\vee K_n\)
- Adjacent vertex distinguishing edge coloring of IC-planar graphs
- The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six
- 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?)
- Adjacent vertex distinguishing edge coloring of planar graphs with girth at least 6
- Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
- Adjacent vertex distinguishing edge-coloring of planar graphs with girth at least five.
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
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)
