16 citations · 97 across the 26 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 13 cited
k-L(2,1)-Labelling for Planar Graphs is NP-Complete for k >= 4
Nicole Eggemann, Frédéric Havet, Steven D. Noble
A mapping from the vertex set of a graph G = (V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integer…
cs.DM2009★ 2 cited
Acyclic Edge coloring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…