default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJing-Ho Yan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]Fei-Huang Chang, Ma-Lian Chia, Shih-Ang Jiang, David Kuo, Jing-Ho Yan:
n-fold L(2, 1)-labelings of Cartesian product of paths and cycles. J. Comb. Optim. 47(3): 48 (2024)
2010 – 2019
- 2015
- [j17]Chun-Chun Lin, Jing-Ho Yan:
On L(d, 1)-Labelings of the Cartesian Product of Two Cycles. Ars Comb. 122: 33-53 (2015) - 2014
- [j16]Gerard Jennhwa Chang
, Ma-Lian Chia, David Kuo, Ji-Yin Lin, Jing-Ho Yan:
Bandwidth sums of block graphs and cacti. J. Comb. Optim. 27(4): 679-687 (2014) - [j15]Chan-Wei Chang, David Kuo, Sheng-Chyang Liaw, Jing-Ho Yan:
F3-domination problem of graphs. J. Comb. Optim. 28(2): 400-413 (2014) - 2013
- [j14]Ma-Lian Chia, David Kuo, Jing-Ho Yan, Siou-Ru Yang:
(p, q)-total labeling of complete graphs. J. Comb. Optim. 25(4): 543-561 (2013)
2000 – 2009
- 2008
- [j13]David Kuo, Jing-Ho Yan:
The profile of the Cartesian product of graphs. Discret. Appl. Math. 156(15): 2835-2845 (2008) - [j12]Shih-Hu Chiang, Jing-Ho Yan:
On L(d, 1)-labeling of Cartesian product of a cycle and a path. Discret. Appl. Math. 156(15): 2867-2881 (2008) - 2007
- [j11]Ying-Da Chen, Jing-Ho Yan:
A study on cyclic bandwidth sum. J. Comb. Optim. 14(2-3): 295-308 (2007) - [j10]Chih-Jen Wu, Yu-Wei Chen, Jing-Ho Yan, Yue-Li Wang:
Seamless channel transition for slotted generalized fibonacci broadcasting. Multim. Syst. 13(3): 223-233 (2007) - 2005
- [j9]Mei-Ju Chen, David Kuo, Jing-Ho Yan:
The bandwidth sum of join and composition of graphs. Discret. Math. 290(2/3): 145-163 (2005) - 2004
- [j8]David Kuo, Jing-Ho Yan:
On L(2, 1)-labelings of Cartesian products of paths and cycles. Discret. Math. 283(1-3): 137-144 (2004) - 2002
- [j7]Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh:
A note on the Gallai-Roy-Vitaver Theorem. Discret. Math. 256(1-2): 441-444 (2002) - 2001
- [j6]Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan:
On Cycle Sequences. Graphs Comb. 17(1): 129-133 (2001)
1990 – 1999
- 1997
- [j5]Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
k-Path Partitions in Trees. Discret. Appl. Math. 78(1-3): 227-233 (1997) - [j4]Jing-Ho Yan, Ko-Wei Lih, David Kuo, Gerard J. Chang:
Signed degree sequences of signed graphs. J. Graph Theory 26(2): 111-117 (1997) - 1996
- [j3]Maw-Shang Chang, Yi-Hua Chen, Gerard J. Chang, Jing-Ho Yan:
Algorithmic Aspects of the Generalized Clique-transversal Problem on Chordal Graphs. Discret. Appl. Math. 66(3): 189-203 (1996) - [j2]Jing-Ho Yan, Jer-Jeong Chen, Gerard J. Chang:
Quasi-threshold Graphs. Discret. Appl. Math. 69(3): 247-255 (1996) - 1994
- [j1]Jing-Ho Yan, Gerard J. Chang:
The Path-Partition Problem in Block Graphs. Inf. Process. Lett. 52(6): 317-322 (1994)
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:02 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:
