Adjacent vertex distinguishing edge coloring of IC-planar graphs
From MaRDI portal
Publication:2136165
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
- scientific article; zbMATH DE number 6303005 (Why is no real title available?)
- 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 four
- Chromatic number, independence ratio, and crossing number
- Graph theory with applications
- On Neighbor-Distinguishing Index of Planar Graphs
- On edge colorings of \(1\)-planar graphs
Cited in
(3)
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)