Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles

DOI10.1007/S40840-019-00860-3MaRDI QIDQ2186285zbMATHOpenAlexWikidataFDO

Authors Danjun Huang, Xiaoxiu Zhang, Ping Wang, Weifan Wang

Publication date 9 June 2020

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-019-00860-3

zbMATH Keywords

cycleplanar 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) Paths and cycles (05C38)

Recommendations

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

Cites work

• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five
• 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 indices of planar graphs without 3-cycles
• Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \(\Delta\)
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
• \(r\)-strong edge colorings of graphs

Cited in

(11)

• 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?)
• The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles
• Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Neighbor-distinguishing indices of planar graphs with maximum degree ten
• 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.
• Adjacent vertex distinguishing indices of planar graphs without 3-cycles

This page was built for publication: Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles

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