Convex embeddings and bisections of 3-connected graphs

Combinatorica

Volumn 22, Issue 4, 2002, Pages 537-554

  Nagamochi, Hiroshi ^a   Jordán, Tibor ^b   Nakao, Yoshitaka ^c   Ibaraki, Toshihide ^d  

^a TOYOHASHI UNIVERSITY OF TECHNOLOGY   (Japan)

^b EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^c Sumitomo Metal Industries Ltd   (Japan)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037000918     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00493-002-0006-8     Document Type: Article

References (18)

1. J. CHERIYAN and J. H. REIF: Directed s-t numberings, rubber bands, and testing digraph k-vertex connectivity, Combinatorica, 14(4) (1994), 435-451.
2. L. CHI-YUAN, J. MATOUŠEK and W. STEIGER: Algorithms for ham-sandwich cuts, Discrete Comput. Geom., 11 (1994), 433-452.
3. J. CHLEÍKOVÁ: Approximating the maximally balanced connected partition problem in graphs, Information Processing Letters, 60 (1996), 225-230.
4. M. E. DYER and A. M. FRIEZE: On the complexity of partitioning graphs into connected subgraphs, Discrete Applied Mathematics, 10 (1985), 139-153.
5. H. EDELSBRUNNER: Algorithms in Combinatorial Geometry, Springer-Verlag, Berlin, 1987.
6. H. EDELSBRUNNER and R. WAUPOTITSCH: Computing a ham-sandwich cut in two dimensions, J. Symbolic Computation, 2 (1986), 171-178.
7. M. R. GAREY, D. S. JOHNSON and R. E. TARJAN: The planar Hamiltonian circuit problem is NP-complete, SIAM J. Comput., 5 (1976), 704-714.
8. E. GYO″RI: On division of connected subgraphs, Combinatorics, (Proc. Fifth Hungarian Combinatorial Coll, 1976, Keszthely), Bolyai-North-Holland, 1978, 485-494.
9. J. HOPCROFT and R.E. TARJAN: Dividing a graph into triconnected components, SIAM J. Comput., 2 (1973), 135-158.
10. N. LINIAL. L. LOVÁSZ and A. WIGDERSON: Rubber bands, convex embeddings and graph connectivity, Combinatorica, 8 (1988), 91-102.
11. L. LOVÁSZ: A homology theory for spanning trees of a graph, Acta Math. Acad. Sci. Hungar, 30 (1977), 241-251.
12. H. NAGAMOCHI and T. IBARAKI: A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), 583-596.
13. E. STEINITZ: Polyeder und Raumeinteilungen, Encyklopädie der mathematischen Wissenschaften, Band III, Teil 1, 2. Hälfte, IIIAB12, 1916, 1-139.
14. H. SUZUKI, N. TAKAHASHI and T. NISHIZEKI: A linear algorithm for bipartition of biconnected graphs, Information Processing Letters, 33 (1990), 227-232.
15. W. T. TUTTE: Connectivity in Graphs, University of Toronto Press, 1966.
16. K. WADA and K. KAWAGUCHI: Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs, Lecture Notes in Comput. Sci., 790, Springer, Graph-theoretic concepts in computer science, 1994, 132-143.
17. K. WADA, K. KAWAGUCHI and N. YOKOYAMA: On a generalized k-partition problem for graphs, Proc. 6th Karuizawa Workshop on Circuit and Systems, 1993, 243-248.
18. G. M. ZIEGLER: Lectures on Polytopes, Springer-Verlag, Graduate Texts in Mathematics 152, 1995.