Graphes
- 1 January 2010
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Graph Minors. XX. Wagner's conjectureJournal of Combinatorial Theory, Series B, 2004
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Kuratowski's theoremJournal of Graph Theory, 1981
- Planarity and duality of finite and infinite graphsJournal of Combinatorial Theory, Series B, 1980
- Comments on F. Hadlock’s Paper: “Finding a Maximum Cut of a Planar Graph in Polynomial Time”SIAM Journal on Computing, 1977
- Efficient Planarity TestingJournal of the ACM, 1974
- Modules unimodulairesJournal of Combinatorial Theory, 1968
- Topological sorting of large networksCommunications of the ACM, 1962
- Monotone networksProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1960
- Non-Separable and Planar GraphsTransactions of the American Mathematical Society, 1932