Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Wong, Pak-Ken"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for finding longest cycles in certain bipartite graphs
Pak-Ken Wong
International Journal of Foundations of Computer Science
12
(4), 2001, pp. 445-454
Optimal path cover problem on block graphs
Pak-Ken Wong
Theoretical Computer Science
225
(1-2), 1999, pp. 163-169
An algorithm for finding a maximum cycle of bipartite graphs with large degrees
Pak-Ken Wong
International Journal of Foundations of Computer Science
7
(4), 1996, pp. 301-307
Cages - A survey
Pak-Ken Wong
Journal of Graph Theory
6
(1), 1982, pp. 1-22
A smallest graph of girth 5 and valency 6
M. O'Keefe
,
Pak-Ken Wong
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 145-149
On the uniqueness of the smallest graph of girth 5 and valency 6
Pak-Ken Wong
Journal of Graph Theory
3
(4), 1979, pp. 407-409
A note on a paper of G. Wegner
Pak-Ken Wong
Journal of Combinatorial Theory Series B
22
, 1977, pp. 302-303