Editing Interval graph (section)

== References ==
{{sfn whitelist |CITEREFCormenLeisersonRivestStein2001}}
{{refbegin|30em}}
*{{citation
 | last1 = Bar-Noy | first1 = Amotz
 | last2 = Bar-Yehuda | first2 = Reuven
 | last3 = Freund | first3 = Ari
 | last4 = Naor | first4 = Joseph (Seffi) | author4-link = Joseph Seffi Naor
 | last5 = Schieber | first5 = Baruch | author5-link = Baruch Schieber
 | title = A unified approach to approximating resource allocation and scheduling
 | journal = [[Journal of the ACM]]
 | year = 2001
 | volume = 48
 | issue = 5
 | pages = 1069–1090
 | doi = 10.1145/502102.502107| citeseerx = 10.1.1.124.9886| s2cid = 12329294 }}
*{{citation
 | last1 = Beyerl | first1 = Jeffery J.
 | last2 = Jamison | first2 = Robert E.
 | arxiv = 1109.6675
 | contribution = Interval graphs with containment restrictions
 | mr = 2489816
 | pages = 117–128
 | series = Congressus Numerantium
 | title = Proceedings of the Thirty-Ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing
 | volume = 191
 | year = 2008}}
*{{citation
 | last1 = Bliznets | first1 = Ivan
 | last2 = Fomin | first2 = Fedor V.
 | last3 = Pilipczuk | first3 = Marcin
 | last4 = Pilipczuk | first4 = Michał
 | editor1-last = Schulz | editor1-first = Andreas S.
 | editor2-last = Wagner | editor2-first = Dorothea | editor2-link = Dorothea Wagner
 | arxiv = 1402.3473
 | contribution = A subexponential parameterized algorithm for proper interval completion
 | doi = 10.1007/978-3-662-44777-2_15
 | pages = 173–184
 | publisher = Springer-Verlag
 | series = Lecture Notes in Computer Science
 | title = Proceedings of the 22nd Annual European Symposium on Algorithms (ESA 2014), Wroclaw, Poland, September 8–10, 2014
 | volume = 8737
 | year = 2014| isbn = 978-3-662-44776-5
 | s2cid = 12385294}}
*{{citation
 | last = Bodlaender | first = Hans L. | authorlink = Hans L. Bodlaender
 | doi = 10.1016/S0304-3975(97)00228-4
 | issue = 1–2
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | pages = 1–45
 | title = A partial {{mvar|k}}-arboretum of graphs with bounded treewidth
 | volume = 209
 | year = 1998| hdl = 1874/18312 | hdl-access = free}}
*{{citation
 | last1 = Bonnet | first1 = Édouard
 | last2 = Kim | first2 = Eun Jung | author2-link = Eun Jung Kim (parameterized complexity)
 | last3 = Thomassé | first3 = Stéphan
 | last4 = Watrigant | first4 = Rémi
 | arxiv = 2004.14789
 | doi = 10.1145/3486655
 | issue = 1
 | journal = [[Journal of the ACM]]
 | mr = 4402362
 | page = A3:1–A3:46
 | title = Twin-width I: Tractable FO model checking
 | volume = 69
 | year = 2022}}
*{{citation
 | last1 = Booth | first1 = K. S. | last2 = Lueker | first2 = G. S.
 | title = Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
 | journal = [[Journal of Computer and System Sciences]]
 | volume = 13
 | pages = 335–379
 | year = 1976
 | doi = 10.1016/S0022-0000(76)80045-1
 | issue = 3| doi-access = free
 }}
*{{citation
 | last1 = Brandstädt
 | first1 = A.
 | last2 = Le
 | first2 = V.B.
 | last3 = Spinrad
 | first3 = J.P.
 | title = Graph Classes: A Survey
 | publisher = SIAM Monographs on Discrete Mathematics and Applications
 | year = 1999
 | isbn = 978-0-89871-432-6
 | url-access = registration
 | url = https://archive.org/details/graphclassessurv0000bran}}
*{{citation|year=1978|last=Cohen|first=Joel E.|authorlink=Joel E. Cohen|title=Food webs and niche space|series=Monographs in Population Biology|volume=11|issue=11|pages=1–189|location=Princeton, NJ|publisher=Princeton University Press|pmid=683203|isbn=978-0-691-08202-8}}
*{{Introduction to Algorithms|edition=2|mode=cs2}}
*{{citation
 | last1 = Corneil | first1 = Derek | author1-link = Derek Corneil
 | last2 = Olariu | first2 = Stephan
 | last3 = Stewart | first3 = Lorna | author3-link = Lorna Stewart
 | issue = 4
 | journal = [[SIAM Journal on Discrete Mathematics]]
 | pages = 1905–1953
 | title = The LBFS structure and recognition of interval graphs
 | volume = 23
 | year = 2009
 | doi = 10.1137/S0895480100373455}}
*{{citation
 | last = Eckhoff | first = Jürgen
 | doi = 10.1002/jgt.3190170112
 | issue = 1
 | journal = [[Journal of Graph Theory]]
 | pages = 117–127
 | title = Extremal interval graphs
 | volume = 17
 | year = 1993}}
*{{citation
 | last1 = Faudree | first1 = Ralph | author1-link = Ralph Faudree
 | last2 = Flandrin | first2 = Evelyne
 | last3 = Ryjáček | first3 = Zdeněk
 | doi = 10.1016/S0012-365X(96)00045-3
 | issue = 1–3
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | pages = 87–147
 | title = Claw-free graphs — A survey
 | volume = 164
 | year = 1997
 | mr = 1432221| doi-access = free
 }}
*{{citation|last=Fishburn|first=Peter C.|authorlink=Peter C. Fishburn|year=1985|title=Interval orders and interval graphs: A study of partially ordered sets|series=Wiley-Interscience Series in Discrete Mathematics|location=New York|publisher=John Wiley & Sons}}
*{{citation
 | author1-link = D. R. Fulkerson | last1 = Fulkerson | first1 = D. R. 
 | last2 = Gross | first2 = O. A.
 | title = Incidence matrices and interval graphs
 | journal = [[Pacific Journal of Mathematics]]
 | volume = 15
 | issue = 3 | pages = 835–855
 | year = 1965 | doi=10.2140/pjm.1965.15.835| doi-access = free}}
*{{citation
 | last         = Gardi  | first        = Frédéric
 | title        = The Roberts characterization of proper and unit interval graphs
 | date         = 2007
 | journal      = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | volume       = 307
 | issue        = 22
 | pages        = 2906–2908
 | doi          = 10.1016/j.disc.2006.04.043| doi-access= 
 }}
*{{citation
 | last1 = Gilmore | first1 = P. C.
 | last2 = Hoffman | first2 = A. J.
 | title = A characterization of comparability graphs and of interval graphs
 | journal = Canadian Journal of Mathematics
 | volume = 16
 | pages = 539–548
 | year = 1964
 | doi = 10.4153/CJM-1964-055-5| doi-access = free
 }}
*{{citation
 | last = Golumbic | first = Martin Charles | author-link = Martin Charles Golumbic
 | title = Algorithmic Graph Theory and Perfect Graphs
 | publisher = Academic Press
 | year = 1980
 | isbn = 978-0-12-289260-8}}
*{{citation
 | last1 = Golumbic | first1 = Martin Charles | author1-link = Martin Charles Golumbic
 | last2 = Shamir | first2 = Ron | author2-link = Ron Shamir
 | title = Complexity and algorithms for reasoning about time: a graph-theoretic approach
 | journal = [[Journal of the ACM]]
 | volume = 40
 | issue = 5 | pages = 1108–1133
 | year = 1993 | doi=10.1145/174147.169675| citeseerx = 10.1.1.35.528| s2cid = 15708027 }}
*{{citation
 | last1 = Habib | first1 = Michel | last2 = McConnell | first2 = Ross
 | last3 = Paul | first3 = Christophe | last4 = Viennot | first4 = Laurent
 | title = Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition, and consecutive ones testing
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | volume = 234
 | issue = 1–2 | pages = 59–84
 | year = 2000
 | url = http://www.cs.colostate.edu/~rmm/lexbfs.ps
 | doi = 10.1016/S0304-3975(97)00241-7| doi-access = free}}
*{{citation
 | last = Hanlon | first = Phil
 | doi = 10.2307/1998705
 | issue = 2
 | journal = Transactions of the American Mathematical Society
 | jstor = 1998705
 | mr = 662044
 | pages = 383–426
 | title = Counting interval graphs
 | volume = 272
 | year = 1982| doi-access = free
 }}
*{{citation
 | last = Hsu | first = Wen-Lian
 | editor-last = Mayr | editor-first = Ernst W.
 | contribution = A simple test for interval graphs
 | doi = 10.1007/3-540-56402-0_31
 | pages = 11–16
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Graph-Theoretic Concepts in Computer Science, 18th International Workshop, WG '92, Wiesbaden-Naurod, Germany, June 19–20, 1992, Proceedings
 | volume = 657
 | year = 1992| isbn = 978-3-540-56402-7
 }}
*{{citation
 | last1 = Klavík | first1 = Pavel
 | last2 = Otachi | first2 = Yota
 | last3 = Šejnoha | first3 = Jiří
 | arxiv = 1510.03998
 | doi = 10.1007/s00453-018-0481-y
 | issue = 4
 | journal = [[Algorithmica]]
 | mr = 3936165
 | pages = 1490–1511
 | title = On the classes of interval graphs of limited nesting and count of lengths
 | volume = 81
 | year = 2019| s2cid = 254028486
 }}
*{{citation
 | last1 = Lekkerkerker | first1 = C. G. | author1-link = Gerrit Lekkerkerker
 | last2 = Boland | first2 = J. C.
 | title = Representation of a finite graph by a set of intervals on the real line 
 | journal = [[Fundamenta Mathematicae]]
 | volume = 51
 | pages = 45–64
 | year = 1962
| doi = 10.4064/fm-51-1-45-64 
 | doi-access = free}}
*{{citation
 | last1 = McKee | first1 = Terry A.
 | last2 = McMorris | first2 = F. R.
 | title = Topics in Intersection Graph Theory
 | publisher = SIAM Monographs on Discrete Mathematics and Applications 
 | year = 1999
 | isbn = 978-0-89871-430-2}}
*{{citation|last1=Proskurowski|first1=Andrzej|last2=Telle|first2=Jan Arne|title=Classes of graphs with restricted interval models|journal=Discrete Mathematics & Theoretical Computer Science|date=1999|volume=3|issue=4|pages=167–176|citeseerx=10.1.1.39.9532}}
*{{citation
 | last = Roberts | first = F. S. | author-link = Fred S. Roberts
 | editor-last = Harary | editor-first = Frank | editor-link = Frank Harary
 | chapter = Indifference graphs
 | title = Proof Techniques in Graph Theory
 | pages = 139–146
 | year = 1969
 | isbn = 978-0123242600
 | oclc = 30287853
 | publisher = [[Academic Press]]
 | location = [[New York, NY]]}}
*{{citation
 | last1 = Villanger | first1 = Yngve 
 | last2 = Heggernes | first2 = Pinar | author2-link = Pinar Heggernes
| last3 = Paul | first3 = Christophe
| last4 = Telle | first4 = Jan Arne
| doi = 10.1137/070710913
 | journal = [[SIAM Journal on Computing]]
 | pages = 2007–2020
 | title = Interval completion is fixed parameter tractable
 | volume = 38 | issue = 5
 | year = 2009| citeseerx = 10.1.1.73.8999| s2cid = 8521105 
 }}
*{{citation
 | last1 = Yang | first1 = Joyce C.
 | last2 = Pippenger | first2 = Nicholas | author2-link = Nick Pippenger
 | doi = 10.1090/bproc/27
 | journal = Proceedings of the American Mathematical Society
 | mr = 3613306
 | pages = 1–3
 | series = Series B
 | title = On the enumeration of interval graphs
 | volume = 4
 | year = 2017| s2cid = 38225412
 | arxiv = 1609.02479
 }}
*{{citation
 | last1 = Zhang | first1 = Peisen | last2 = Schon | first2 = Eric A. | last3 = Fischer | first3 = Stuart G.
 | last4 = Cayanis | first4 = Eftihia | last5 = Weiss | first5 = Janie
 | last6 = Kistler | first6 = Susan | last7 = Bourne | first7 = Philip E.
 | title = An algorithm based on graph theory for the assembly of contigs in physical mapping of DNA
 | journal = [[Bioinformatics (journal)|Bioinformatics]]
 | volume = 10
 | issue = 3
 | year = 1994
 | pages = 309–317
 | doi =  10.1093/bioinformatics/10.3.309| pmid = 7922688 }}
{{refend}}