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
Hilfe
Suche: Author="Chen, Bor-Liang"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Linear
k
-arboricities on trees
Gerard J. Chang
,
Bor-Liang Chen
,
Hung-Lin Fu
,
Kuo-Ching Huang
Discrete Applied Mathematics
103
(1-3), 2000, pp. 281-287
Equitable and
m
-bounded coloring of split graphs
Bor-Liang Chen
,
Ming-Tat Ko
,
Ko-Wei Lih
Lecture Notes in Computer Science
1120
, 1996, pp. 1-5
Equitable coloring of trees
Bor-Liang Chen
,
Ko-Wei Lih
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 83-87
Total colorings of graphs of order
2n
having maximum degree
2n-2
Bor-Liang Chen
,
Hung-Lin Fu
Graphs and Combinatorics
8
, 1992, pp. 119-123
Diameters of iterated clique graphs of chordal graphs
Bor-Liang Chen
,
Ko-Wei Lih
Journal of Graph Theory
14
(3), 1990, pp. 391-396
Hamiltonian uniform subset graphs
Bor-Liang Chen
,
Ko-Wei Lih
Journal of Combinatorial Theory Series B
42
(3), 1987, June, pp. 257-263