Adjacent vertex distinguishing edge coloring of IC-planar graphs
From MaRDI portal
Publication:2136165
DOI10.1007/S10878-021-00807-0zbMATH Open1492.05047OpenAlexW3201589777MaRDI QIDQ2136165FDOQ2136165
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
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Adjacent strong edge coloring of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Adjacent Vertex Distinguishing Edge‐Colorings
- On Neighbor-Distinguishing Index of Planar Graphs
- Chromatic number, independence ratio, and crossing number
- On edge colorings of \(1\)-planar graphs
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree
Cited In (3)
Recommendations
- Title not available (Why is that?) 👍 👎
- Adjacent Vertex Distinguishing Edge‐Colorings 👍 👎
- Title not available (Why is that?) 👍 👎
- The adjacent vertex distinguishing total coloring of planar graphs 👍 👎
- Title not available (Why is that?) 👍 👎
- 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 👍 👎
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)
