Login / Signup
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23.
Lin Sun
Guanglong Yu
Xin Li
Published in:
Discret. Appl. Math. (2023)
Keyphrases
</>
planar graphs
undirected graph
minimum weight
weighted graph
directed graph
edge weights
spanning tree
connected components
edge information
complex networks
edge detection
edge detector
approximation algorithms
bipartite graph
directed acyclic graph
approximate inference
optimal solution