Content deleted Content added
Citation bot (talk | contribs) Add: s2cid, doi-access. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 764/1125 |
TheMathCat (talk | contribs) m reference updated (the paper is published) + wikilinks |
||
Line 48:
| last1 = Dvořák | first1 = Zdeněk | author1-link = Zdeněk Dvořák
| last2 = Norin | first2 = Sergey
| journal = [[SIAM Journal on Discrete Mathematics]]
| volume = 30
| issue = 2
| pages = 1095–1101
| arxiv = 1504.04821
| title = Strongly sublinear separators and polynomial expansion
| year =
| doi=10.1137/15M1017569}}.
*{{citation
| first1 = G. | last1 = Ehrlich | first2 = S. | last2 = Even | first3 = R. E. | last3 = Tarjan | author3-link = Robert Tarjan
| title = Intersection graphs of curves in the plane
| journal = [[Journal of Combinatorial Theory]]
| volume = 21
| issue = 1
Line 73 ⟶ 78:
| first1 = M. | last1 = Golumbic | first2 = D. | last2 = Rotem | first3 = J. | last3 = Urrutia | author3-link = Jorge Urrutia Galicia
| title = Comparability graphs and intersection graphs
| journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
| volume = 43
| year = 1983
Line 87 ⟶ 92:
| 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 97 ⟶ 102:
| 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
Line 114 ⟶ 119:
| pages = 55–87}}.
*{{citation
| journal = [[Discrete
| title = Recognizing string graphs is decidable
| first1 = János | last1 = Pach | author1-link = János Pach | first2 = Geza | last2 = Tóth
| |||