A characterization of planar graphs by trémaux orders-Reference-Cited by-同舟云学术

A characterization of planar graphs by trémaux orders

Published:1985-06 Issue:2 Volume:5 Page:127-135
ISSN:0209-9683
Container-title:Combinatorica
language:en
Short-container-title:Combinatorica

Author:

de Fraysseix H.,Rosenstiehl P.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Discrete Mathematics and Combinatorics

Link

http://link.springer.com/content/pdf/10.1007/BF02579375.pdf

Reference7 articles.

1. H. de Fraysseix andP. Rosenstiehl, L’algorithme Gauche-Droite pour le test de planarité et l’implantation des graphes (to appear).

2. J. Hopcroft andR. E. Tarjan, Efficient planarity testing.J. Assoc. Comput. Mach. 21 (1974), 549–568.

3. R. B. Levow, On Tutte’s algebraic approach to the theory of crossing numbers,Proc. 3rd S-E. Conf. Combinatorics, Graph Theory and Computing (1972), 315–324.

4. Y. Liu,Acta Math. Appl. Sinica 1 (1978), 321–329.

5. P. Rosenstiehl, Preuve algébrique du critère de planarité de Wu-Liu.Annals of Disc. Maths. 9 (1980), North-Holland, 67–78.

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves;Lecture Notes in Computer Science;2023

2. Compact Distributed Certification of Planar Graphs;Algorithmica;2021-05-06

3. Compact Distributed Certification of Planar Graphs;Proceedings of the 39th Symposium on Principles of Distributed Computing;2020-07-31

4. Exact Algorithms for the Maximum Planar Subgraph Problem;ACM Journal of Experimental Algorithmics;2019-12-17

5. A Direct Proof of the Strong Hanani–Tutte Theorem on the Projective Plane;Lecture Notes in Computer Science;2016