Browsing by Author "Chen, BL"

Now showing 1 - 4 of 4

A study of the total chromatic number of equibipartite graphs
(1998-04-06)
Chen, BL
;
Cheng, CK
;
Fu, HL
;
Huang, KC
;
應用數學系
The total chromatic number chi(t)(G) of a graph G is the least number of colors needed to color the vertices and edges of G so that no adjacent vertices or edges receive the same color, no incident edges receive the same color as either of the vertices it is incident with. In this paper, we obtain some results of the total chromatic number of the equibiparrite graphs of order 2n with maximum degree n - 1. As a part of our results, we disprove the biconformability conjecture. (C) 1998 Published by Elsevier Science B.V. All rights reserved.
Giant anisotropy of carrier mobility in electroluminescent conjugated polymer
(2006-01-09)
Meng, HF
;
Chen, BL
;
Tzeng, KC
;
Horng, SF
;
物理研究所
The horizontal and vertical hole mobility of amorphous spin-coated electroluminescent conjugated films are studied. It is found that the horizontal mobility is about four orders of magnitude larger than the vertical mobility. The horizontal mobility increases daily with the aging of the polymer solution from which the film is spun. Low temperature and photoluminescence study reveal that the giant mobility anisotropy is a result of the alignment of the aggregates, formed during aging, by the centrifugal force of the spin.
Linear k-arboricities on trees
(2000-07-15)
Chang, GJ
;
Chen, BL
;
Fu, HL
;
Huang, KC
;
應用數學系
For a fixed positive integer k, the linear k-arboricity la(k)(G) of a graph G is the minimum number l such that the edge set E(G) can be partitioned into G disjoint sets and that each induces a subgraph whose components are paths of lengths at most k. This paper studies linear k-arboricity from an algorithmic point of view. In particular, we present a linear-time algorithm to determine whether a tree T has la(k)(T)less than or equal to m. (C) 2000 Elsevier Science B.V. All rights reserved.
Total chromatic number of graphs of order 2n+1 having maximum degree 2n-1
(1995-12-01)
Yap, HP
;
Chen, BL
;
Fu, HL
;
應用數學系
;
Department of Applied Mathematics
Let G be a graph of order 2n+1 having maximum degree 2n-1. We prove that the total chromatic number of G is 2n if and only if e(G-w) + alpha'(G-w) greater than or equal to n, where w is a vertex of minimum degree in G, G-w is the complement of G-w, e(G-w) is the size of G-w, and alpha'(G-w) is the edge independence number of G-w.