default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJenq-Jong Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j17]Jenq-Jong Lin, Min-Jen Jou:
Minimum coverings of crowns with cycles and stars. Discuss. Math. Graph Theory 42(1): 81-88 (2022)
2010 – 2019
- 2018
- [j16]Jenq-Jong Lin, Hung-Chih Lee:
Decomposition of the complete bipartite graph with a 1-factor removed into paths and stars. Contributions Discret. Math. 13(2) (2018) - 2016
- [j15]Jenq-Jong Lin:
Packing and covering λ-fold complete symmetric digraphs with 6-circuits. Ars Comb. 124: 229-238 (2016) - [j14]Jenq-Jong Lin:
The number of maximal independent sets in trees and forests. Ars Comb. 125: 85-96 (2016) - 2015
- [j13]Jenq-Jong Lin:
Trees with the second and third largest number of maximum independent sets. Ars Comb. 123: 317-327 (2015) - 2013
- [j12]Jenq-Jong Lin:
Quasi-tree graphs with the second largest number of maximal independent sets. Ars Comb. 108: 257-267 (2013) - [j11]Jenq-Jong Lin:
Quasi-tree graphs with the largest and the second largest numbers of maximum independent sets. Ars Comb. 108: 403-413 (2013) - [j10]Jenq-Jong Lin, Min-Jen Jou:
Trees with the fourth largest number of maximal independent sets. Ars Comb. 109: 299-308 (2013) - [j9]Hung-Chih Lee, Jenq-Jong Lin:
Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars. Discret. Math. 313(20): 2354-2358 (2013) - 2010
- [j8]Jenq-Jong Lin:
Quasi-tree graphs with the largest number of maximal independent sets. Ars Comb. 97 (2010) - [j7]Jenq-Jong Lin:
Maximum Packings of Complete Graphs with Octagons. Ars Comb. 97 (2010) - [j6]Jenq-Jong Lin:
Decomposition of balanced complete bipartite multigraphs into multistars. Discret. Math. 310(5): 1059-1065 (2010)
2000 – 2009
- 2009
- [j5]Min-Jen Jou, Jenq-Jong Lin:
Trees with the second largest number of maximal independent sets. Discret. Math. 309(13): 4469-4474 (2009) - 2005
- [j4]Hung-Chih Lee, Jenq-Jong Lin, Chiang Lin, Tay-Woei Shyu:
Multistar Decomposition of Complete Multigraphs. Ars Comb. 74 (2005) - 2003
- [j3]Chiang Lin, Jenq-Jong Lin, Hung-Chih Lee:
Some Decomposition Invariants of Crowns. Ars Comb. 66 (2003) - 2000
- [j2]Chiang Lin, Jenq-Jong Lin:
Cycle decompositions of crowns. Discret. Math. 220(1-3): 251-255 (2000)
1990 – 1999
- 1999
- [j1]Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Isomorphic Star Decompositions of Multicrowns and the Power of Cycles. Ars Comb. 53 (1999) - 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
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-04-03 01:18 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:
