Geodesic
Planar ordered sets of width two
Mathematica slovaca, Tome 40 (1990) no. 4, pp. 375-388
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05C10, 06A07, 68R10 
@article{MASLO_1990_40_4_a4,
     author = {Czyzowicz, Jurek and Pelc, Andrzej and Rival, Ivan},
     title = {Planar ordered sets of width two},
     journal = {Mathematica slovaca},
     pages = {375--388},
     year = {1990},
     volume = {40},
     number = {4},
     mrnumber = {1120968},
     zbl = {0753.06001},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a4/}
}
TY  - JOUR
AU  - Czyzowicz, Jurek
AU  - Pelc, Andrzej
AU  - Rival, Ivan
TI  - Planar ordered sets of width two
JO  - Mathematica slovaca
PY  - 1990
SP  - 375
EP  - 388
VL  - 40
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a4/
LA  - en
ID  - MASLO_1990_40_4_a4
ER  - 
%0 Journal Article
%A Czyzowicz, Jurek
%A Pelc, Andrzej
%A Rival, Ivan
%T Planar ordered sets of width two
%J Mathematica slovaca
%D 1990
%P 375-388
%V 40
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a4/
%G en
%F MASLO_1990_40_4_a4
Czyzowicz, Jurek; Pelc, Andrzej; Rival, Ivan. Planar ordered sets of width two. Mathematica slovaca, Tome 40 (1990) no. 4, pp. 375-388. http://geodesic.mathdoc.fr/item/MASLO_1990_40_4_a4/

[1] J. CZYZOWICZ A. PELC, I. RIVAL (1987) : Drawing orders with few slopes. to appear. | MR

[2] J. CZYZOWICZ A. PELC I. RIVAL, J. URRUTIA (1987) : Crooked diagrams with few slopes. to appear. | MR

[3] I. FARY (1948) : On the straight line representation of planar graphs. Acta Sci. Math (Szeged) 11, 229-233. | MR

[4] J. HOPCROFT, R. TARJAN (1974) : Efficient planarity testing. J. Assoc. Comp. Mach. 21, 549-568. | MR

[5] D. KELLY (1987) : Fundamentals of planar ordered sets. Discrete Math. 63, 197-216. | MR

[6] D. KELLY, I. RIVAL (1975) : Planar lattices. Canad. J. Math., 27, 636-665. | MR

[7] S. MICALI, V. V. VAZIRANI (1980) : An $O\sqrt{n\ldot |E|} algorithm for finding maximum matchings in general graphs. In: 21st Ann. Symp. Foundations Comp. Science, IEEE, Syracuse, pp. 17-27.

[8] R. NОWAKОWSKI I. RIVAL, J. URRUTIA (1987) : Lattice graphs contained in planar graphs are planar. to appear.

[9] A. PELC, I. RIVAL (1987) : Оrders with level diagrams. to appear.

[10] C. PLATT (1976) : Planar lattices and planar graphs. J. Combin. Theory B, 21, 30-39. | MR

[11] K. WAGNER (1936) : Bemerkungen zum Vierfarbenproblem. Jber. Deutsch. Math. Verein., 46, 26-32.