On the two-connected planar spanning subgraph polytope

Discrete Applied Mathematics

Volumn 80, Issue 2-3, 1997, Pages 223-229

  De Simone, Caterina ^a,b   Jünger, Michael ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

^b CNR   (Italy)

Author keywords

Facets; Planar graphs; Polyhedra; Two connected graphs

Indexed keywords

EID: 30244560235     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00087-5     Document Type: Article

References (7)

1. C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam, 1973.
2. M.R. Garey, D.S. Johnson, Computer and Intractability: a Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
3. K. Kuratowski, Sur le problème de courbes gauches en topologie, Fund. Math. 15 (1930) 271-283.
4. P. Mutzel, The maximum planar subgraph problem, Ph.D. Dissertation, Universität zu Köln, 1994.
5. P. Mutzel, A polyhedral approach to planar augmentation and related problems, in: P. Spirakis (Ed.), Algorithms - ESA'95, Lecture Notes in Computer Science, 1995, pp. 494-507.
6. A. Schrijver, Theory of Linear and Integer Programming, Wiley, Chichester, 1986.
7. M. Stoer, Design of Survivable Networks, Lecture Notes in Mathematics, Springer, Berlin, 1992.