default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBor-Liang Chen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j17]Wei-Tian Li
, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih:
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. Electron. J. Comb. 20(3): 38 (2013)- [j16]Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen:
Equivalence of two conjectures on equitable coloring of graphs. J. Comb. Optim. 25(4): 501-504 (2013) - 2012
- [j15]Bor-Liang Chen, Chih-Hung Yen:
Equitable Δ-coloring of graphs. Discret. Math. 312(9): 1512-1517 (2012) - 2008
- [j14]Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu:
Near automorphisms of cycles. Discret. Math. 308(7): 1088-1092 (2008) - [j13]Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen:
Chromatic coloring with a maximum color class. Discret. Math. 308(23): 5533-5537 (2008) - 2002
- [j12]Bor-Liang Chen, Kuo-Ching Huang:
On the linear k-arboricity of Kn and Kn, n. Discret. Math. 254(1-3): 51-61 (2002) - 2000
- [j11]Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Linear k-arboricities on trees. Discret. Appl. Math. 103(1-3): 281-287 (2000) - 1999
- [j10]Bor-Liang Chen, Lei Dong, Qi Zhang Liu, Kuo-Ching Huang:
Total colorings of equibipartite graphs. Discret. Math. 194(1-3): 59-65 (1999) - 1998
- [j9]Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang:
A study of the total chromatic number of equibipartite graphs. Discret. Math. 184(1-3): 49-60 (1998) - 1994
- [j8]Bor-Liang Chen, Hung-Lin Fu:
Edge domination in complete partite graphs. Discret. Math. 132(1-3): 29-35 (1994) - [j7]Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu:
Equitable Coloring and the Maximum Degree. Eur. J. Comb. 15(5): 443-447 (1994) - [j6]Bor-Liang Chen, Ko-Wei Lih:
Equitable Coloring of Trees. J. Comb. Theory B 61(1): 83-87 (1994) - 1993
- [j5]Bor-Liang Chen, Ko-Wei Lih:
A Note on the m-Bounded Chromatic Number of a Tree. Eur. J. Comb. 14(4): 311-312 (1993) - 1992
- [j4]Bor-Liang Chen, Hung-Lin Fu:
Total colorings of graphs of order 2n having maximum degree 2n-2. Graphs Comb. 8(2): 119-123 (1992) - 1991
- [j3]Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang:
Decomposing graphs into forests of paths with size less than three. Australas. J Comb. 3: 55-74 (1991) - 1990
- [j2]Bor-Liang Chen, Ko-Wei Lih:
Diameters of iterated clique graphs of chordal graphs. J. Graph Theory 14(3): 391-396 (1990) - 1987
- [j1]Bor-Liang Chen, Ko-Wei Lih:
Hamiltonian uniform subset graphs. J. Comb. Theory B 42(3): 257-263 (1987)
Conference and Workshop Papers
- 2002
- [c3]Yin-Tsung Hwang, Cheng-Ji Chang, Bor-Liang Chen:
A rapid prototyping embedded system platform and its HW/SW communication interface generation and verification. APCCAS (1) 2002: 481-484 - 1997
- [c2]Hung-Min Sun, Bor-Liang Chen:
On the decomposition constructions for perfect secret sharing schemes. ICICS 1997: 50-60 - 1995
- [c1]Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih:
Equitable and m-Bounded Coloring of Split Graphs. Combinatorics and Computer Science 1995: 1-5
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
