Revision as of 08:42, 16 July 2024 edit 666-Bandera Mouse (talk \| contribs) 221 edits No edit summary ← Previous edit		Revision as of 12:32, 12 August 2024 edit undo Citation bot (talk \| contribs) Bots 5,865,931 edits Altered journal. \| Use this bot. Report bugs. \| Suggested by Abductive \| Category:NP-complete problems \| #UCB_Category 89/181 Next edit →
Line 94: \| first = Jan \| last = Kratochvil \| authorlink = Jan Kratochvíl \| title = String Graphs. I. The number of critical nonstring graphs is infinite \| journal = [[Journal of Combinatorial Theory]], Series B \| year = 1991a \| volume = 52 Line 104: \| first = Jan \| last = Kratochvil \| authorlink = Jan Kratochvíl \| title = String Graphs. II. Recognizing string graphs is NP-Hard \| journal = [[Journal of Combinatorial Theory]], Series B \| year = 1991b \| volume = 52

String graph: Difference between revisions