Computation of lucky number of planar graphs is NP-hard

Introduction to Graph Theory

J. Fields · 2001 · 4.1K citations

Network Science, Graph Theory, Graph Algorithms +8

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Engineering, Graph Theory, Np-complete Graph Problems +6

Edge weights and vertex colours

Michał Karoński, Tomasz Łuczak, Andrew Thomason · Journal of Combinatorial Theory Series B · 2004 · 347 citations

Graph Theory, Education, Network Analysis +5

Degree constrained subgraphs

Louigi Addario‐Berry, Ketan Dalal, Bruce A. Reed · Discrete Applied Mathematics · 2007 · 121 citations

Mathematical Programming, Graph Minor, Network Science +8

Vertex colouring edge partitions

Louigi Addario‐Berry, R. E. L. Aldred, Ketan Dalal et al. · Journal of Combinatorial Theory Series B · 2005 · 109 citations

Graph Theory, Extremal Graph Theory, Edge Partitions +5