Nobuji Saito, Takao Nishizeki (Eds.):
Graph Theory and Algorithms, 17th Symposium of Research Institute of Electric Communication, Tohoku University, Sendai, Japan, October 24-25, 1980, Proceedings.
Lecture Notes in Computer Science 108 Springer 1981, ISBN 3-540-10704-5 
- Wataru Mayeda:
Dividing a system into almost unidirectional blocks.
1-8
- Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A linear algorithm for five-coloring a planar graph.
9-19
- Shuji Tsukiyama, Ernest S. Kuh, Isao Shirakawa:
On the layering problem of multilayer PWB wiring.
20-37
- Jin Akiyama:
A status on the linear arboricity.
38-44
- G. Kishi:
On centrality functions of a graph.
45-52
- Satoru Fujishige:
Canonical decompositions of symmetric submodular systems.
53-64
- T. Hirata, M. Kimura:
The subgraph homeomorphism problem on reducible flow graphs.
65-78
- K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs.
79-94
- Takao Ozawa, H. Takahashi:
A graph-planarization algorithm and its application to random graphs.
95-107
- Claude Berge:
Some common properties for regulizable graphs, edge-critical graphs and B-graphs.
108-123
- Masao Iri:
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.
124-136
- Shoji Shinoda, Tatsuya Kawamoto:
On central trees of a graph.
137-151
- Takumi Kasai, Akeo Adachi:
On polynominal time computable problems.
152-158
- Masakazu Nasu:
Homomorphisms of graphs and their global maps.
159-170
- Toshinobu Kashiwabara:
Algorithms for some intersection graphs.
171-181
- Takao Asano, S. Kikuchi, Nobuji Saito:
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.
182-195
- H. Hosoya:
Characterization of polyhex graphs as applied to chemistry.
196-206
- Tatsuo Ohtsuki:
The two disjoint path problem and wire routing design.
207-216
Last update Sun May 19 22:22:07 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
