论文信息 - Generalizations of planar graphs

Generalizations of planar graphs

Two new generalizations of planar graphs, called quasiplanar and pseudoplanar graphs, are introduced and discussed. It is shown that planar graphs are quasiplanar and these in turn are pseudoplanar. Conversely, a pseudoplanar graph that contains with each arc its reverse arc is quasiplanar. A Kuratowski-type characterization of quasiplanar graphs is given; in it the excluded subgraphs differ from Kuratowski's only by the addition of an edge in the bipartite graph.

Ranel E. Erickson | R. E. Erickson

[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .

[2] Y. Shiloach. The two paths problem is polynomial , 1978 .

[3] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[4] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .

[5] K. Menger. Zur allgemeinen Kurventheorie , 1927 .

[6] Richard M. Karp,et al. On the Computational Complexity of Combinatorial Problems , 1975, Networks.