Editing Chordal graph (section)

==References==
*{{citation
 | last = Agnarsson | first = Geir
 | issue = 2
 | journal = Mathematica Scandinavica
 | mr = 2009583
 | pages = 240–246
 | title = On chordal graphs and their chromatic polynomials
 | url = http://www.mscand.dk/article/view/14421
 | volume = 93
 | year = 2003| doi = 10.7146/math.scand.a-14421
 | doi-access = free
 }}.
*{{citation
 | last1 = Bender | first1 = E. A.
 | last2 = Richmond | first2 = L. B.
 | last3 = Wormald | first3 = N. C.
 | doi = 10.1017/S1446788700023077
 | mr = 0770128
 | issue = 2
 | journal = J. Austral. Math. Soc.
 | series = A
 | pages = 214–221
 | title = Almost all chordal graphs split
 | volume = 38
 | year = 1985| doi-access = free
 }}.
*{{citation
 | last = Berge | first = Claude
 | contribution = Some Classes of Perfect Graphs
 | editor1-last = Harary | editor1-first = Frank | editor1-link = Frank_Harary
 | pages = 155–165
 | publisher = Academic Press
 | title = Graph Theory and Theoretical Physics
 | year = 1967
 | mr = 0232694}}.
*{{citation
 | last1 = Berry | first1 = Anne 
 | last2 = Golumbic | first2 = Martin Charles | author2-link = Martin Charles Golumbic
 | last3 = Lipshteyn| first3 = Marina 
 | title     = Recognizing chordal probe graphs and cycle-bicolorable graphs
 | journal   = [[SIAM Journal on Discrete Mathematics]]
 | volume    = 21
 | year      = 2007
 | pages     = 573–591
 | doi = 10.1137/050637091
 | issue = 3}}.
*{{citation
 | last1 = Bodlaender | first1 = H. L. | author1-link = Hans L. Bodlaender
 | last2 = Fellows | first2 = M. R. | author2-link = Michael Fellows
 | last3 = Warnow | first3 = T. J. | author3-link = Tandy Warnow
 | contribution = Two strikes against perfect phylogeny
 | doi = 10.1007/3-540-55719-9_80
 | pages = 273–283
 | series = Lecture Notes in Computer Science
 | title = [[International Colloquium on Automata, Languages and Programming|Proc. of 19th International Colloquium on Automata Languages and Programming]]
 | volume = 623
 | year = 1992| hdl = 1874/16653 | contribution-url = https://dspace.library.uu.nl/bitstream/1874/16653/1/bodlaender_92_two%20strikes.pdf
 | hdl-access = free
 }}.
*{{citation
 | last1 = Chandran | first1 = L. S.
 | last2 = Ibarra | first2 = L.
 | last3 = Ruskey | first3 = F. | author3-link = Frank Ruskey
 | last4 = Sawada | first4 = J.
 | doi = 10.1016/S0304-3975(03)00221-4
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | pages = 303–317
 | title = Enumerating and characterizing the perfect elimination orderings of a chordal graph
 | url = http://www.cis.uoguelph.ca/~sawada/papers/chordal.pdf
 | volume = 307
 | year = 2003
 | issue = 2}}.
*{{citation
 | last = Dirac | first = G. A. | authorlink = Gabriel Andrew Dirac
 | doi = 10.1007/BF02992776
 | mr = 0130190
 | journal = Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
 | pages = 71–76
 | title = On rigid circuit graphs
 | volume = 25
 | year = 1961| issue = 1–2 | s2cid = 120608513
 }}.
*{{citation
 | last1 = Fomin | first1 = Fedor V.
 | last2 = Villanger | first2 = Yngve
 | journal = SIAM J. Comput.
 | pages = 2197–2216
 | title = Subexponential Parameterized Algorithm for Minimum Fill-In
 | volume = 42
 | year = 2013
 | issue = 6
 | doi=10.1137/11085390X| arxiv = 1104.2230| s2cid = 934546
 }}.
*{{citation
 | last1 = Fulkerson | first1 = D. R. | author1-link = D. R. Fulkerson
 | last2 = Gross | first2 = O. A.
 | journal = Pacific J. Math.
 | pages = 835–855
 | title = Incidence matrices and interval graphs
 | url = http://projecteuclid.org/Dienst/UI/1.0/Summarize/euclid.pjm/1102995572
 | volume = 15
 | year = 1965 | issue = 3 | doi=10.2140/pjm.1965.15.835| doi-access = free
 }}.
*{{citation
 | last = Gavril | first = Fănică
 | doi = 10.1016/0095-8956(74)90094-X
 | journal = [[Journal of Combinatorial Theory]] | series = Series B
 | pages = 47–56
 | title = The intersection graphs of subtrees in trees are exactly the chordal graphs
 | volume = 16
 | year = 1974| doi-access = free
 }}.
*{{citation
 |first=Martin Charles|last=Golumbic
 |authorlink=Martin Charles Golumbic
 |title=Algorithmic Graph Theory and Perfect Graphs
 |year=1980|publisher=Academic Press}}.
*{{citation
 | last1 = Habib | first1 = Michel
 | last2 = McConnell | first2 = Ross
 | last3 = Paul | first3 = Christophe
 | last4 = Viennot | first4 = Laurent
 | doi = 10.1016/S0304-3975(97)00241-7
 | journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
 | pages = 59–84
 | title = Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition, and consecutive ones testing
 | url = http://www.cs.colostate.edu/~rmm/lexbfs.ps
 | volume = 234
 | year = 2000| issue = 1–2
 | doi-access = free
 }}.
*{{citation
 | last1 = Kaplan | first1 = Haim
 | last2 = Shamir | first2 = Ron
 | last3 = Tarjan | first3 = Robert
 | journal = SIAM J. Comput.
 | pages = 1906–1922
 | title = Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
 | volume = 28
 | year = 1999 | issue = 5
 | doi=10.1137/S0097539796303044}}.
*{{citation
 | last = Maffray | first = Frédéric
 | contribution = On the coloration of perfect graphs
 | doi = 10.1007/0-387-22444-0_3
 | editor1-last = Reed | editor1-first = Bruce A. | editor1-link = Bruce Reed (mathematician)
 | editor2-last = Sales | editor2-first = Cláudia L.
 | pages = 65–84
 | publisher = Springer-Verlag
 | series = CMS Books in Mathematics
 | title = Recent Advances in Algorithms and Combinatorics
 | volume = 11
 | year = 2003
 | isbn = 0-387-95434-1}}.
*{{citation
 | last1 = Parra | first1 = Andreas
 | last2 = Scheffler | first2 = Petra
 | doi = 10.1016/S0166-218X(97)00041-3
 | issue = 1–3
 | journal = Discrete Applied Mathematics
 | mr = 1478250
 | pages = 171–188
 | title = Characterizations and algorithmic applications of chordal graph embeddings
 | volume = 79
 | year = 1997| doi-access = free
 }}.
*{{citation
 | last = Patil | first = H. P.
 | mr = 966069
 | issue = 2–4
 | journal = Journal of Combinatorics, Information and System Sciences
 | pages = 57–64
 | title = On the structure of ''k''-trees
 | volume = 11
 | year = 1986}}.
*{{citation
 | last = Rose | first = Donald J.
 | date = December 1970
 | doi = 10.1016/0022-247x(70)90282-9
 | issue = 3
 | journal = Journal of Mathematical Analysis and Applications
 | pages = 597–609
 | title = Triangulated graphs and the elimination process
 | volume = 32}}
*{{citation
 | last1 = Rose | first1 = D.
 | last2 = Lueker | first2 = George
 | last3 = Tarjan | first3 = Robert E. | author3-link = Robert E. Tarjan
 | doi = 10.1137/0205021
 | journal = [[SIAM Journal on Computing]]
 | mr = 0408312
 | pages = 266–283
 | title = Algorithmic aspects of vertex elimination on graphs
 | volume = 5
 | year = 1976
 | issue = 2}}.
*{{citation
 | last1 = Seymour | first1 = P. D. | author1-link = Paul Seymour (mathematician)
 | last2 = Weaver | first2 = R. W.
 | doi = 10.1002/jgt.3190080206
 | issue = 2
 | journal = [[Journal of Graph Theory]]
 | mr = 742878
 | pages = 241–251
 | title = A generalization of chordal graphs
 | volume = 8
 | year = 1984}}.
*{{citation
 | last1 = Szwarcfiter | first1 = J.L. | author1-link = Jayme Luiz Szwarcfiter 
 | last2 = Bornstein | first2 = C.F.
 | journal = [[SIAM Journal on Discrete Mathematics]]
 | pages = 331–336
 | title = Clique graphs of chordal and path graphs
 | volume = 7
 | year = 1994 | issue = 2 | doi=10.1137/s0895480191223191| hdl = 11422/1497| hdl-access = free}}.