Adjacent vertex distinguishing edge coloring of IC-planar graphs

DOI10.1007/S10878-021-00807-0MaRDI QIDQ2136165zbMATH OpenOpenAlexFDO

Authors Zhuoya Liu, Changqing Xu

Publication date 10 May 2022

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

Full work available at URL https://doi.org/10.1007/s10878-021-00807-0

zbMATH Keywords

adjacent vertex distinguishing edge coloringdischarging methodIC-planar graph

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 coloring of graphs
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent vertex distinguishing edge coloring of planar graphs without intersecting triangles
• The adjacent vertex distinguishing total coloring of planar graphs
• scientific article; zbMATH DE number 7028145
• On the adjacent vertex distinguishing edge colourings of graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles
• Adjacent vertex-distinguishing acyclic edge coloring of graphs
• Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four

Cites work

• A characterization on the adjacent vertex distinguishing index of planar graphs with large maximum degree
• Adjacent strong edge coloring of graphs
• Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
• Adjacent Vertex Distinguishing Edge‐Colorings
• Adjacent vertex-distinguishing edge coloring of graphs
• Chromatic number, independence ratio, and crossing number
• Graph theory with applications
• On edge colorings of \(1\)-planar graphs
• On Neighbor-Distinguishing Index of Planar Graphs

Cited in

(5)

• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23
• Strong Edge Coloring of Outerplane Graphs with Independent Crossings
• Improper odd coloring of IC-planar graphs
• An exact algorithm for the adjacent vertex distinguishing sum edge coloring problem
• Neighbor-distinguishing index of IC-planar graphs

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

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