Linear algorithms to recognize outerplanar and maximal outerplanar graphs
DOI: 10.1016/0020-0190(79)90075-9
关键词: Mathematics 、 K-tree 、 Partial k-tree 、 Chordal graph 、 Discrete mathematics 、 Pathwidth 、 Outerplanar graph 、 Dense graph 、 1-planar graph 、 Book embedding 、 Combinatorics
摘要:
elsevier.com
sci-hub.se 参考文章(4)
John Hopcroft, Robert Tarjan, Efficient Planarity Testing Journal of the ACM. ,vol. 21, pp. 549- 568 ,(1974) , 10.1145/321850.321852
Nicholas D. Roussopoulos, A max {m,n} algorithm for determining the graph H from its line graph G Information Processing Letters. ,vol. 2, pp. 108- 112 ,(1973) , 10.1016/0020-0190(73)90029-X
Pǎnicǎ Gavril, An algorithm for testing chordality of graphs Information Processing Letters. ,vol. 3, pp. 110- 112 ,(1975) , 10.1016/0020-0190(75)90043-5
Frank Harary, Graph theory ,(1969)