◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Nicole Eggemann

3 papers hereh-index 4106 citations7 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • first author3

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO3

identity via Semantic Scholar / OpenAlex

activity
20082010
most citedk-L(2,1)-Labelling for Planar Graphs is NP-Complete for k >= 4

13 citations · 13 across the 3 of their papers we have counts for

collaborators
Showing 2009Show all

1 paper · 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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.