Graph Theory and Algorithms: 17th Symposium of Research Institute of Electrical Communication, Tohoku University, Sendai, Japan, October 24-25, 1980. Proceedings (Lecture Notes in Computer Science)

Dividing a system into almost unidirectional blocks....Pages 1-8 A linear algorithm for five-coloring a planar graph....Pages 9-19 On the layering problem of multilayer PWB wiring....Pages 20-37 A status on the linear arboricity....Pages 38-44 On centrality functions of a graph....Pages 45-52 Canonical decompositions of symmetric submodular systems....Pages 53-64 The subgraph homeomorphism problem on reducible flow graphs....Pages 65-78 Combinatorial problems on series-parallel graphs....Pages 79-94 A graph-planarization algorithm and its application to random graphs....Pages 95-107 Some common properties for regularizable graphs, edge-critical graphs and b-graphs....Pages 108-123 "Dualities" in graph theory and in the related fields viewed from the metatheoretical standpoint....Pages 124-136 On central trees of a graph....Pages 137-151 On polynomial time computable problems....Pages 152-158 Homomorphisms of graphs and their global maps....Pages 159-170 Algorithms for some intersection graphs....Pages 171-181 An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph....Pages 182-195 Characterization of polyhex graphs as applied to chemistry....Pages 196-206 The two disjoint path problem and wire routing design....Pages 207-216