![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Discrete Mathematics, Volume 130
Volume 130, Numbers 1-3, July 1994
- Achille Achache, Gena Hahn, Maurice Pouzet, Ivo G. Rosenberg:
Preface. 1 - Achille Achache, Arturo A. L. Sangalli:
Préordres, résiduation et espaces de fermeture. 3-7 - Marie-France Bélanger, Julien Constantin, Gilles Fournier:
Graphes et ordonnés démontables, propriété de la clique fixe. 9-17 - Fatiha Bendali, Alain Quilliot:
Compatibilité entre structures d'intervalles et relations d'orde. 19-37 - Michel Burlet, Jean Fonlupt:
Polyhedral consequences of the amalgam operation. 39-55 - Pierre Duchet, Viktor Kaneti:
Sur la contractibilité d'un graphe orienté en K*4. 57-68 - Gilles Fournier, L. Gagnon:
Théorème de point fixe asymptotique dans les ordonnés infinis. 69-76 - Simone Hazan, Ivo G. Rosenberg:
TC-clones maximaux, graphes et relations. 77-82 - François Laviolette:
Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree. 83-87 - Norbert Polat:
Minimax theorems for infinite graphs with the ends as ideal points. 89-96 - Norbert Polat, Gert Sabidussi:
Fixed elements of infinite trees. 97-102 - Maurice Pouzet, Ivo G. Rosenberg:
General metrics and contracting operations. 103-169 - Patrick Solé:
The edge-forwarding index of orbital regular graphs. 171-176 - Mark E. Watkins:
Sur les graphes infinis possedant un groupe d'automorphismes primitif. 177-182
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.