default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKuo-Ching Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j14]Kuo-Ching Huang, Ko-Wei Lih:
A note on m-near-factor-critical graphs. Eur. J. Comb. 80: 273-276 (2019)- 2016
- [j13]Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima:
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths. Graphs Comb. 32(4): 1397-1413 (2016) - 2014
- [j12]Kuo-Ching Huang, Ko-Wei Lih:
Nordhaus-Gaddum-type relations of three graph coloring parameters. Discret. Appl. Math. 162: 404-408 (2014) - 2013
- [j11]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) - [j10]Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue:
A note on optimal pebbling of hypercubes. J. Comb. Optim. 25(4): 597-601 (2013)
2000 – 2009
- 2008
- [j9]Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen:
The linear 3-arboricity of Kn, n and Kn. Discret. Math. 308(17): 3816-3823 (2008) - [j8]Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen:
Chromatic coloring with a maximum color class. Discret. Math. 308(23): 5533-5537 (2008) - 2002
- [j7]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
- [j6]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)
1990 – 1999
- 1999
- [j5]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
- [j4]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) - 1997
- [j3]Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger:
Connectivity of cages. J. Graph Theory 24(2): 187-191 (1997) - 1994
- [j2]Hung-Lin Fu, Kuo-Ching Huang:
On prime labellings. Discret. Math. 127(1-3): 181-186 (1994) - 1991
- [j1]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)
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:44 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:
