default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHua-Min Huang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j16]Shin-Shin Kao, Hua-Min Huang, Kung-Ming Hsu, Lih-Hsing Hsu:
Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. Ars Comb. 110: 301-322 (2013)- 2012
- [j15]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. Ars Comb. 105: 231-246 (2012)
2000 – 2009
- 2009
- [j14]Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. Discret. Math. 309(17): 5474-5483 (2009) - [j13]Chung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu:
The super spanning connectivity and super spanning laceability of the enhanced hypercubes. J. Supercomput. 48(1): 66-87 (2009) - 2008
- [j12]Cheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu:
On spanning connected graphs. Discret. Math. 308(7): 1330-1333 (2008) - [c3]Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. ISPAN 2008: 151-158 - 2007
- [j11]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
On the spanning connectivity of graphs. Discret. Math. 307(2): 285-289 (2007) - [j10]Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu:
On the equitable k *-laceability of hypercubes. J. Comb. Optim. 14(2-3): 349-364 (2007) - [j9]Chao-Ming Sun, Chun-Nan Hung, Hua-Min Huang, Lih-Hsing Hsu, Yue-Dar Jou:
Hamiltonian laceability of Faulty Hypercubes. J. Interconnect. Networks 8(2): 133-145 (2007) - 2006
- [j8]Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Panpositionable Hamiltonian Graphs. Ars Comb. 81 (2006) - [j7]Hong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The Spanning Connectivity of the (n, k)-star Graphs. Int. J. Found. Comput. Sci. 17(2): 415-434 (2006) - [j6]Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. J. Interconnect. Networks 7(2): 235-256 (2006) - [j5]Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
On the spanning w-wide diameter of the star graph. Networks 48(4): 235-249 (2006) - 2005
- [j4]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau:
Mutually independent hamiltonian paths in star networks. Networks 46(2): 110-117 (2005) - [j3]Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The super connectivity of the pancake graphs and the super laceability of the star graphs. Theor. Comput. Sci. 339(2-3): 257-271 (2005) - [c2]Chao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang:
Mutually Independent Hamiltonian Cycles in Hypercubes. ISPAN 2005: 504-509 - 2004
- [j2]Chung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
The super laceability of the hypercubes. Inf. Process. Lett. 92(1): 15-21 (2004) - [c1]Cheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
The Spanning Diameter of the Star Graphs. ISPAN 2004: 551-556 - 2003
- [j1]Hua-Min Huang, Frank K. Hwang, Jian-Feng Ma:
Using transforming matrices to generate DNA clone grids. Discret. Appl. Math. 129(2-3): 421-431 (2003)
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-24 23:04 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:
