论文信息 - Projective Planarity in Linear Time - 字舞流文

Projective Planarity in Linear Time

Abstract A linear time algorithm for embedding graphs in the projective plane is presented.

Bojan Mohar | B. Mohar

[1] Pierre Rosenstiehl,et al. A Depth-First-Search Characterization of Planarity , 1982 .

[2] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.

[3] Paul D. Seymour,et al. Graph minors. VIII. A kuratowski theorem for general surfaces , 1990, J. Comb. Theory, Ser. B.

[4] Almira Karabeg. Classification and detection of obstructions to planarity , 1990 .

[5] Stephen A. Cook,et al. Time Bounded Random Access Machines , 1973, J. Comput. Syst. Sci..

[6] S. Gill Williamson,et al. Depth-First Search and Kuratowski Subgraphs , 1984, JACM.

[7] Henry H. Glover,et al. 103 Graphs that are irreducible for the projective plane , 1979, J. Comb. Theory, Ser. B.

[8] Dan Archdeacon,et al. A Kuratowski theorem for the projective plane , 1981, J. Graph Theory.

[9] Carsten Thomassen,et al. The Graph Genus Problem is NP-Complete , 1989, J. Algorithms.

[10] Norishige Chiba,et al. A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[11] Carsten Thomassen,et al. Embeddings of graphs with no short noncontractible cycles , 1990, J. Comb. Theory, Ser. B.

[12] Gary L. Miller,et al. On determining the genus of a graph in O(v O(g)) steps(Preliminary Report) , 1979, STOC.

[13] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..