Editing Outerplanar graph (section)

==References==
{{refbegin|colwidth=30em}}
*{{citation
 | last = Baker | first = Brenda S. | authorlink = Brenda Baker
 | doi = 10.1145/174644.174650
 | issue = 1
 | journal = [[Journal of the ACM]]
 | pages = 153–180
 | title = Approximation algorithms for NP-complete problems on planar graphs
 | volume = 41
 | year = 1994| s2cid = 9706753 | doi-access = free
 }}.
*{{citation
 | last1 = Boza | first1 = Luis
 | last2 = Fedriani | first2 = Eugenio M.
 | last3 = Núñez | first3 = Juan
 | journal = [[Ars Combinatoria (journal)|Ars Combinatoria]]
 | pages = 79–91
 | title = The problem of outer embeddings in pseudosurfaces
 | volume = 71
 | year = 2004}}.
*{{citation
 | last1 = Boza | first1 = Luis
 | last2 = Fedriani | first2 = Eugenio M.
 | last3 = Núñez | first3 = Juan
 | journal = [[Ars Combinatoria (journal)|Ars Combinatoria]]
 | pages = 65–77
 | title = Obstruction sets for outer-bananas-surface graphs
 | volume = 73
 | year = 2004}}.
*{{citation
 | last1 = Boza | first1 = Luis
 | last2 = Fedriani | first2 = Eugenio M.
 | last3 = Núñez | first3 = Juan
 | journal = [[Acta Mathematica Hungarica]]
 | pages = 307–313
 | title = Uncountable graphs with all their vertices in one face
 | volume = 112
 | year = 2006 | issue = 4
 | doi=10.1007/s10474-006-0082-0 | doi-access= | hdl = 11441/163886
 | s2cid = 123241658
 }}.
*{{citation
 | last1 = Boza | first1 = Luis
 | last2 = Fedriani | first2 = Eugenio M.
 | last3 = Núñez | first3 = Juan
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | pages = 3359–3367
 | title = Outer-embeddability in certain pseudosurfaces arising from three spheres
 | volume = 310
 | year = 2010 | issue = 23
 | doi=10.1016/j.disc.2010.07.027| doi-access = free
 }}.
*{{citation
 | last1 = Brandstädt
 | first1 = Andreas
 | author1-link = Andreas Brandstädt
 | last2 = Le
 | first2 = Van Bang
 | last3 = Spinrad
 | first3 = Jeremy
 | title = Graph Classes: A Survey
 | series = SIAM Monographs on Discrete Mathematics and Applications
 | publisher = [[Society for Industrial and Applied Mathematics]]
 | year = 1999
 | isbn = 0-89871-432-X
 | url-access = registration
 | url = https://archive.org/details/graphclassessurv0000bran
 }}.
*{{citation
 | last1 = Chartrand | first1 = Gary | authorlink = Gary Chartrand
 | last2 = Harary | first2 = Frank | author2-link = Frank Harary
 | issue = 4
 | journal = Annales de l'Institut Henri Poincaré B
 | mr = 0227041
 | pages = 433–438
 | title = Planar permutation graphs
 | url = http://www.numdam.org/item?id=AIHPB_1967__3_4_433_0
 | volume = 3
 | year = 1967}}.
*{{citation
 | last = Diestel | first = Reinhard
 | isbn = 0-387-98976-5
 | page = 107
 | publisher = Springer-Verlag
 | series = [[Graduate Texts in Mathematics]]
 | title = Graph Theory
 | volume = 173
 | year = 2000}}.
*{{citation
 | last = El-Gindy | first = H.
 | publisher = [[McGill University]]
 | series = Ph.D. thesis
 | title = Hierarchical decomposition of polygons with applications
 | year = 1985}}. As cited by {{harvtxt|Brandstädt|Le|Spinrad|1999}}.
*{{citation
 | last = Felsner | first = Stefan
 | isbn = 978-3-528-06972-8
 | page = 6
 | publisher = Vieweg+Teubner Verlag
 | title = Geometric graphs and arrangements: some chapters from combinational geometry
 | year = 2004}}.
*{{citation
 | last = Fiorini | first = Stanley
 | doi = 10.1016/0095-8956(75)90060-X
 | issue = 1
 | journal = [[Journal of Combinatorial Theory]] | series = Series B
 | pages = 35–38
 | title = On the chromatic index of outerplanar graphs
 | volume = 18
 | year = 1975| doi-access = free
 }}.
*{{citation
 | last = Fisk | first = Steve
 | doi = 10.1016/0095-8956(78)90059-X
 | journal = [[Journal of Combinatorial Theory]] | series = Series B
 | page = 374
 | title = A short proof of Chvátal's watchman theorem
 | volume = 24
 | year = 1978| issue = 3
 | doi-access = 
 }}.
*{{citation
 | last1 = Fleischner | first1 = Herbert J.
 | last2 = Geller | first2 = D. P.
 | last3 = Harary | first3 = Frank | author3-link = Frank Harary
 | mr = 0389672
 | journal = Journal of the Indian Mathematical Society
 | pages = 215–219
 | title = Outerplanar graphs and weak duals
 | volume = 38
 | year = 1974}}.
*{{citation
 | last1 = Kane | first1 = Vinay G.
 | last2 = Basu | first2 = Sanat K.
 | doi = 10.1016/0012-365X(76)90006-6
 | issue = 1
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | pages = 63–67
 | title = On the depth of a planar graph
 | volume = 14
 | year = 1976| doi-access = free
 }}.
*{{citation
 | last1 = Li | first1 = Ming-Chu
 | last2 = Corneil | first2 = Derek G. | author2-link = Derek Corneil
 | last3 = Mendelsohn | first3 = Eric
 | doi = 10.1016/S0166-218X(99)00163-8
 | issue = 3
 | journal = [[Discrete Applied Mathematics]]
 | pages = 219–225
 | title = Pancyclicity and NP-completeness in planar graphs
 | volume = 98
 | year = 2000| doi-access = free
 }}.
*{{citation
 | last1 = Lick | first1 = Don R.
 | last2 = White | first2 = Arthur T.
 | journal = [[Canadian Journal of Mathematics]]
 | pages = 1082–1096
 | title = {{mvar|k}}-degenerate graphs
 | url = http://www.smc.math.ca/cjm/v22/p1082
 | volume = 22
 | year = 1970
 | issue = 5
 | doi=10.4153/CJM-1970-125-1| s2cid = 124609794
 | doi-access = free
 }}.
*{{citation
 | last1 = Lin | first1 = Yaw-Ling
 | last2 = Skiena | first2 = Steven S. | author2-link = Steven Skiena
 | doi = 10.1142/S0218195995000179
 | issue = 3
 | journal = [[International Journal of Computational Geometry and Applications]]
 | pages = 289–312
 | title = Complexity aspects of visibility graphs
 | volume = 5
 | year = 1995}}.
*{{citation
 | last1 = Proskurowski | first1 = Andrzej
 | last2 = Sysło | first2 = Maciej M.
 | doi = 10.1137/0607016
 | journal = SIAM Journal on Algebraic and Discrete Methods
 | pages = 131–136
 | title = Efficient vertex-and edge-coloring of outerplanar graphs
 | volume = 7
 | year = 1986}}.
*{{citation
 | last = Scheinerman | first = E. R. | authorlink = Ed Scheinerman
 | publisher = [[Princeton University]]
 | series = Ph.D. thesis
 | title = Intersection Classes and Multiple Intersection Parameters of a Graph
 | year = 1984}}. As cited by {{harvtxt|Brandstädt|Le|Spinrad|1999}}.
*{{citation
 | last = Sysło | first = Maciej M.
 | doi = 10.1016/0012-365X(79)90060-8
 | issue = 1
 | journal = [[Discrete Mathematics (journal)|Discrete Mathematics]]
 | pages = 47–53
 | title = Characterizations of outerplanar graphs
 | volume = 26
 | year = 1979| doi-access = 
 }}.
*{{citation
 | last1 = Sysło | first1 = Maciej M.
 | last2 = Proskurowski | first2 = Andrzej
 | contribution = On Halin graphs
 | doi = 10.1007/BFb0071635
 | pages = 248–256
 | publisher = Springer-Verlag
 | series = [[Lecture Notes in Mathematics]]
 | title = Graph Theory: Proceedings of a Conference held in Lagów, Poland, February 10–13, 1981
 | volume = 1018
 | isbn = 978-3-540-12687-4
 | year = 1983}}.
*{{citation
 | last = Unger | first = Walter
 | contribution = On the {{mvar|k}}-colouring of circle-graphs
 | doi = 10.1007/BFb0035832
 | pages = 61–72
 | publisher = Springer-Verlag
 | series = [[Lecture Notes in Computer Science]]
 | title = Proc. 5th [[Symposium on Theoretical Aspects of Computer Science]] (STACS '88)
 | volume = 294
 | year = 1988| isbn = 3-540-18834-7
 }}.
*{{citation
 | last1 = Wessel | first1 = W.
 | last2 = Pöschel | first2 = R.
 | contribution = On circle graphs
 | editor-last = Sachs | editor-first = Horst | editor-link = Horst Sachs
 | pages = 207–210
 | publisher = B.G. Teubner
 | series = Teubner-Texte zur Mathematik
 | title = Graphs, Hypergraphs and Applications: Proceedings of the Conference on Graph Theory Held in Eyba, October 1st to 5th, 1984
 | volume = 73
 | year = 1985}}. As cited by {{harvtxt|Unger|1988}}.
*{{citation
 | last = Wiegers | first = Manfred | title = Graph-Theoretic Concepts in Computer Science | authorlink = Wiegers
 | doi = 10.1007/3-540-17218-1_57
 | series = [[Lecture Notes in Computer Science]]
 | pages = 165–176
 | chapter = Recognizing Outerplanar Graphs in Linear Time
 | volume = 246
 | year = 1986 | doi-access = free
 | isbn = 978-3-540-17218-5 }}.
{{refend}}