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 BibTeX
@proceedings{DBLP:conf/gta/1980,
editor = {Nobuji Saito and
Takao Nishizeki},
title = {Graph Theory and Algorithms, 17th Symposium of Research Institute
of Electric Communication, Tohoku University, Sendai, Japan,
October 24-25, 1980, Proceedings},
booktitle = {Graph Theory and Algorithms},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {108},
year = {1981},
isbn = {3-540-10704-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- Wataru Mayeda:
Dividing a system into almost unidirectional blocks.
1-8 BibTeX
- Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A linear algorithm for five-coloring a planar graph.
9-19 BibTeX
- Shuji Tsukiyama, Ernest S. Kuh, Isao Shirakawa:
On the layering problem of multilayer PWB wiring.
20-37 BibTeX
- Jin Akiyama:
A status on the linear arboricity.
38-44 BibTeX
- G. Kishi:
On centrality functions of a graph.
45-52 BibTeX
- Satoru Fujishige:
Canonical decompositions of symmetric submodular systems.
53-64 BibTeX
- T. Hirata, M. Kimura:
The subgraph homeomorphism problem on reducible flow graphs.
65-78 BibTeX
- K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs.
79-94 BibTeX
- Takao Ozawa, H. Takahashi:
A graph-planarization algorithm and its application to random graphs.
95-107 BibTeX
- Claude Berge:
Some common properties for regulizable graphs, edge-critical graphs and B-graphs.
108-123 BibTeX
- Masao Iri:
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint.
124-136 BibTeX
- S. Shinoda, T. Kawamoto:
On central trees of a graph.
137-151 BibTeX
- Takumi Kasai, Akeo Adachi:
On polynominal time computable problems.
152-158 BibTeX
- Masakazu Nasu:
Homomorphisms of graphs and their global maps.
159-170 BibTeX
- Toshinobu Kashiwabara:
Algorithms for some intersection graphs.
171-181 BibTeX
- Takao Asano, S. Kikuchi, Nobuji Saito:
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph.
182-195 BibTeX
- H. Hosoya:
Characterization of polyhex graphs as applied to chemistry.
196-206 BibTeX
- Tatsuo Ohtsuki:
The two disjoint path problem and wire routing design.
207-216 BibTeX
Copyright © Sat May 16 23:14:09 2009
by Michael Ley (ley@uni-trier.de)
