default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChiang Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j20]Jen-Ling Shang, Tay-Woei Shyu, Chiang Lin:
Weakly status injective trees are status unique in trees. Ars Comb. 139: 133-143 (2018)- 2016
- [j19]Chia-Nung Li, Chiang Lin, Tsu-Kuang Hsieh:
TOD District Planning Based on Residents' Perspectives. ISPRS Int. J. Geo Inf. 5(4): 52 (2016) - 2013
- [j18]Ming-Ju Lee, Wei-Han Tsai, Chiang Lin:
Super (a, 1)-cycle-antimagic labeling of the grid. Ars Comb. 112: 3-12 (2013) - [j17]Tay-Woei Shyu, Ying-Ren Chen, Chiang Lin, Ming-Hong Zhong:
Decomposition of Bipartite Graphs Into Spiders All of Whose Legs Are Two in Length. Ars Comb. 112: 239-248 (2013) - 2012
- [j16]Chiang Lin, Wei-Han Tsai, Jen-Ling Shang, Yuan-Jen Zhang:
Minimum statuses of connected graphs with fixed maximum degree and order. J. Comb. Optim. 24(3): 147-161 (2012) - 2011
- [j15]Ming-Ju Lee, Chiang Lin, Wei-Han Tsai:
On Antimagic Labeling For Power of Cycles. Ars Comb. 98: 161-165 (2011) - [j14]Jen-Ling Shang, Chiang Lin:
Spiders are status unique in trees. Discret. Math. 311(10-11): 785-791 (2011) - 2010
- [j13]Hung-Chih Lee, Ming-Ju Lee, Chiang Lin:
Caterpillar Factorizations of Crowns. Ars Comb. 95 (2010)
2000 – 2009
- 2008
- [j12]Ming-Ju Lee, Chiang Lin:
A Note on Star Arboricity of Crowns. Ars Comb. 88 (2008) - 2007
- [j11]Chiang Lin:
Simple Proofs of Results on Paths Representing All Colors in Proper Vertex-Colorings. Graphs Comb. 23(2): 201-203 (2007) - 2005
- [j10]Hung-Chih Lee, Jenq-Jong Lin, Chiang Lin, Tay-Woei Shyu:
Multistar Decomposition of Complete Multigraphs. Ars Comb. 74 (2005) - [j9]Hung-Chih Lee, Chiang Lin:
Balanced star decompositions of regular multigraphs and lambda-fold complete bipartite graphs. Discret. Math. 301(2-3): 195-206 (2005) - 2003
- [j8]Chiang Lin, Jenq-Jong Lin, Hung-Chih Lee:
Some Decomposition Invariants of Crowns. Ars Comb. 66 (2003) - [j7]Tay-Woei Shyu, Chiang Lin:
Isomorphic Path Decompositions of Crowns. Ars Comb. 67 (2003) - 2001
- [j6]Tay-Woei Shyu, Chiang Lin:
Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs. Ars Comb. 61 (2001) - 2000
- [j5]Chiang Lin, Jenq-Jong Lin:
Cycle decompositions of crowns. Discret. Math. 220(1-3): 251-255 (2000)
1990 – 1999
- 1999
- [j4]Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Isomorphic Star Decompositions of Multicrowns and the Power of Cycles. Ars Comb. 53 (1999) - 1996
- [j3]Min-Jen Jou, Gerard J. Chang, Chiang Lin, Tze-Heng Ma:
A finiteness theorem for maximal independent sets. Graphs Comb. 12(1): 321-326 (1996) - [j2]Chiang Lin, Tay-Woei Shyu:
A necessary and sufficient condition for the star decomposition of complete graphs. J. Graph Theory 23(4): 361-364 (1996) - 1995
- [c1]Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Complete Bipartite Decompositions of Crowns, with Applications to Complete Directed Graphs. Combinatorics and Computer Science 1995: 58-66 - 1991
- [j1]Chiang Lin:
The dimension of the cartesian product of posets. Discret. Math. 88(1): 79-92 (1991)
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-04-25 05:41 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:
