Graph Theory and Algorithms - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540107040, 9783540386612

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Homomorphisms of graphs and their global maps

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_14 ◽

1981 ◽

pp. 159-170

Author(s):

Masakazu Nasu

Download Full-text

On centrality functions of a graph

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_5 ◽

1981 ◽

pp. 45-52 ◽

Cited By ~ 3

Author(s):

G. Kishi

Download Full-text

On central trees of a graph

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_12 ◽

1981 ◽

pp. 137-151 ◽

Cited By ~ 3

Author(s):

S. Shinoda ◽

T. Kawamoto

Download Full-text

On the layering problem of multilayer PWB wiring

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_3 ◽

1981 ◽

pp. 20-37

Author(s):

S. Tsukiyama ◽

E. S. Kuh ◽

I. Shirakawa

Download Full-text

On polynomial time computable problems

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_13 ◽

1981 ◽

pp. 152-158

Author(s):

T. Kasai ◽

A. Adachi

Keyword(s):

Polynomial Time

Download Full-text

Algorithms for some intersection graphs

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_15 ◽

1981 ◽

pp. 171-181 ◽

Cited By ~ 1

Author(s):

T. Kashiwabara

Keyword(s):

Intersection Graphs

Download Full-text

A graph-planarization algorithm and its application to random graphs

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_9 ◽

1981 ◽

pp. 95-107 ◽

Cited By ~ 20

Author(s):

T. Ozawa ◽

H. Takahashi

Keyword(s):

Random Graphs ◽

Graph Planarization

Download Full-text

Some common properties for regularizable graphs, edge-critical graphs and b-graphs

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_10 ◽

1981 ◽

pp. 108-123 ◽

Cited By ~ 8

Author(s):

Claude Berge

Keyword(s):

Critical Graphs

Download Full-text

Canonical decompositions of symmetric submodular systems

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_6 ◽

1981 ◽

pp. 53-64 ◽

Cited By ~ 1

Author(s):

S. Fujishige

Download Full-text

A linear algorithm for five-coloring a planar graph

Graph Theory and Algorithms - Lecture Notes in Computer Science ◽

10.1007/3-540-10704-5_2 ◽

1981 ◽

pp. 9-19 ◽

Cited By ~ 3

Author(s):

N. Chiba ◽

T. Nishizeki ◽

N. Saito

Keyword(s):

Planar Graph ◽

Linear Algorithm

Download Full-text

Graph Theory and Algorithms - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Homomorphisms of graphs and their global maps

On centrality functions of a graph

On central trees of a graph

On the layering problem of multilayer PWB wiring

On polynomial time computable problems

Algorithms for some intersection graphs

A graph-planarization algorithm and its application to random graphs

Some common properties for regularizable graphs, edge-critical graphs and b-graphs

Canonical decompositions of symmetric submodular systems

A linear algorithm for five-coloring a planar graph

Graph Theory and Algorithms - Lecture Notes in Computer Science
Latest Publications