default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChin-Mei Fu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j21]Chin-Mei Fu, Yu-Fong Hsu, Ming-Feng Li:
New Results on Graceful Unicyclic Graphs. Ars Comb. 137: 273-282 (2018)- [j20]Chin-Mei Fu, Yu-Fong Hsu:
Equipartite gregarious connected (5, 5)-graph systems. Discret. Math. 341(5): 1432-1438 (2018) - 2016
- [j19]Chin-Mei Fu, Wen-Chung Huang, Jun-Yuan Tian:
G-Designs Having a Prescribed Number of Blocks in Common. Ars Comb. 129: 185-198 (2016) - [j18]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) - 2013
- [j17]Chin-Mei Fu, Yuan-Lung Lin, Shu-Wen Lo, Yu-Fong Hsu, Wen-Chung Huang:
The Doyen-Wilson theorem for bull designs. Discret. Math. 313(4): 498-507 (2013) - [j16]Chin-Mei Fu, Yu-Fong Hsu, Shu-Wen Lo, Wen-Chung Huang:
Some gregarious kite decompositions of complete equipartite graphs. Discret. Math. 313(5): 726-732 (2013) - [j15]Chin-Mei Fu, Ming-Hway Huang, Yuan-Lung Lin:
On the existence of 5-sun systems. Discret. Math. 313(24): 2942-2950 (2013) - 2012
- [j14]Chin-Mei Fu, Nan-Hua Jhuang, Yuan-Lung Lin:
Integer-Magic Spectra of Sun Graphs. Ars Comb. 103: 55-64 (2012) - [j13]Chin-Mei Fu, Nan-Hua Jhuang, Yuan-Lung Lin, H.-M. Sung:
On the existence of k-sun systems. Discret. Math. 312(12-13): 1931-1939 (2012) - 2011
- [j12]Chin-Mei Fu, Yu-Fong Hsu, Wen-Chung Huang:
The spectrum of 4-cycles in 2-factorizations of Kn, n. Ars Comb. 99: 303-320 (2011) - 2010
- [j11]Chin-Mei Fu, Wen-Chung Huang:
Kite-designs intersecting in pairwise disjoint blocks. Ars Comb. 94 (2010) - 2008
- [j10]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, Todd Smith:
All graphs with maximum degree three whose complements have 4-cycle decompositions. Discret. Math. 308(13): 2901-2909 (2008) - 2007
- [j9]Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. J. Comb. Optim. 14(2-3): 205-218 (2007) - [j8]Ming-Hway Huang, Chin-Mei Fu, Hung-Lin Fu:
Packing 5-cycles into balanced complete m -partite graphs for odd m. J. Comb. Optim. 14(2-3): 323-329 (2007) - [j7]Chao-Chih Chou, Chin-Mei Fu:
Decomposition of K m , n into 4-cycles and 2 t -cycles. J. Comb. Optim. 14(2-3): 383 (2007) - 2004
- [j6]Diane M. Donovan, Chin-Mei Fu, Abdollah Khodkar:
An investigation of 2-critical sets in latin squares. Ars Comb. 72 (2004) - [j5]Chin-Mei Fu, Wen-Chung Huang, Yi-Hsin Shih, Yu-Ju Yaon:
Totally symmetric latin squares with prescribed intersection numbers. Discret. Math. 282(1-3): 123-136 (2004) - [j4]Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger:
Decomposing KncupP into triangles. Discret. Math. 284(1-3): 131-136 (2004) - 1999
- [j3]Chao-Chih Chou, Chin-Mei Fu, Wen-Chung Huang:
Decomposition of Km, n into short cycles. Discret. Math. 197-198: 195-203 (1999) - 1998
- [j2]Yung C. Chen, Chin-Mei Fu:
Construction and Enumeration of Pandiagonal magic squares of order n from Step method. Ars Comb. 48 (1998) - 1996
- [j1]Yeong-Nan Yeh, Ivan Gutman, Chin-Mei Fu:
Graph Transformations Which Preserve the Multiplicity of an Eigenvalue. Discret. Appl. Math. 67(1-3): 221-228 (1996)
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 2025-01-09 12:56 CET 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:
