Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarGraph Theory and Algorithms 1980: Sendai, Japan
BibTeX
RIS
RDF N-Triples
XML
Twitter
Reddit
Mendeley
BibSonomy
LinkedIn
Google+
FacebookNobuji Saito, Takao Nishizeki:
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
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
Norishige Chiba, Takao Nishizeki, Nobuji Saito:
A linear algorithm for five-coloring a planar graph. 9-19
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
On the layering problem of multilayer PWB wiring. 20-37
K. Takamizawa, Takao Nishizeki, Nobuji Saito:
Combinatorial problems on series-parallel graphs. 79-94
Combinatorial problems on series-parallel graphs. 79-94
Takao Ozawa, H. Takahashi:
A graph-planarization algorithm and its application to random graphs. 95-107
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
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
"Dualities" in graph theory and the related fields viewed from the metatheoretical standpoint. 124-136
Takao Asano, Shunji Kikuchi, Nobuji Saito:
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. 182-195
An efficient algorithm to find a Hamiltonian circuit in a 4-connected maximal planar graph. 182-195
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-08-19 09:28 CEST by the dblp team