Journal of Combinatorial Theory Series B · 2003 · 32 citations · 13 references
Natural SciencesHigh-performance ComputingCombinatoricsGraph AlgorithmsGraph ColoringGraph TheoryEdge-disjoint PathsPlanar Graph AlgorithmsPlanar Graph RepresentationsPlanar Graphs
13
Neil Robertson, Daniel P. Sanders, Paul Seymour et al. · Journal of Combinatorial Theory Series B · 1997 · 608 citations
Node-and edge-deletion NP-complete problems
Mihalis Yannakakis · 1978 · 444 citations · Full text