![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Tay-Woei Shyu
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j15]Tay-Woei Shyu:
Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each. Discuss. Math. Graph Theory 41(2): 451-468 (2021)
2010 – 2019
- 2018
- [j14]Jen-Ling Shang, Tay-Woei Shyu, Chiang Lin:
Weakly status injective trees are status unique in trees. Ars Comb. 139: 133-143 (2018) - 2015
- [j13]Tay-Woei Shyu:
Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length. Graphs Comb. 31(5): 1715-1725 (2015) - 2013
- [j12]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) - [j11]Tay-Woei Shyu:
Decomposition of complete bipartite graphs into paths and stars with same number of edges. Discret. Math. 313(7): 865-871 (2013) - [j10]Tay-Woei Shyu:
Decomposition of Complete Graphs into Cycles and Stars. Graphs Comb. 29(2): 301-313 (2013) - 2012
- [j9]Tay-Woei Shyu:
Decomposition of Complete Graphs Into Paths of Length Three and Triangles. Ars Comb. 107: 209-224 (2012) - 2010
- [j8]Tay-Woei Shyu:
Decompositions of Complete Graphs Into Paths and Cycles. Ars Comb. 97 (2010) - [j7]Tay-Woei Shyu:
Decomposition of complete graphs into paths and stars. Discret. Math. 310(15-16): 2164-2169 (2010)
2000 – 2009
- 2007
- [j6]Tay-Woei Shyu:
Path Decompositions of lKn, n. Ars Comb. 85 (2007) - 2005
- [j5]Hung-Chih Lee, Jenq-Jong Lin, Chiang Lin, Tay-Woei Shyu:
Multistar Decomposition of Complete Multigraphs. Ars Comb. 74 (2005) - 2003
- [j4]Tay-Woei Shyu, Chiang Lin:
Isomorphic Path Decompositions of Crowns. Ars Comb. 67 (2003) - 2001
- [j3]Tay-Woei Shyu, Chiang Lin:
Isomorphic Antidirected Path Decompositions of Complete Symmetric Graphs. Ars Comb. 61 (2001)
1990 – 1999
- 1999
- [j2]Chiang Lin, Jenq-Jong Lin, Tay-Woei Shyu:
Isomorphic Star Decompositions of Multicrowns and the Power of Cycles. Ars Comb. 53 (1999) - 1996
- [j1]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
![](https://dblp.org/img/cog.dark.24x24.png)
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:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint