Content deleted Content added
Undid revision 1128891240 by LaundryPizza03 (talk) the topic of this article is a class of graphs, not a problem. We cannot use the categorization "NP-complete problems" for articles on random topics that happen to mention an NP-completeness result; it is not a defining classification for those topics. |
m Open access bot: doi added to citation with #oabot. |
||
Line 144:
| pages = 365–380
| year = 2003
| doi = 10.1016/S0022-0000(03)00045-X
}}.
*{{citation
| journal = Bell System Technical Journal
| |||