default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaphne Der-Fen Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j49]Devsi Bantva
, Daphne Der-Fen Liu:
Radio number for the Cartesian product of two trees. Discret. Appl. Math. 342: 304-316 (2024)- [j48]Fei-Huang Chang, Wei-Tian Li, Daphne Der-Fen Liu, Zhishi Pan:
On k-shifted antimagic spider forests. Discret. Appl. Math. 358: 468-476 (2024) - 2023
- [j47]Angel Chavez, Parker Le, Derek Lin, Daphne Der-Fen Liu, Mason Shurman:
Antimagic labeling for unions of graphs with many three-paths. Discret. Math. 346(6): 113356 (2023) - 2022
- [j46]Colin Bloomfield, Daphne Der-Fen Liu, Jeannette Ramirez:
Radio-k-labeling of cycles for large k. Discret. Appl. Math. 316: 60-70 (2022) - [i2]Devsi Bantva, Daphne Der-Fen Liu:
Radio Number for the Cartesian Product of Two Trees. CoRR abs/2202.13983 (2022) - 2021
- [j45]Angel Chavez, Daphne Der-Fen Liu, Mason Shurman:
Optimal radio-k-labelings of trees. Eur. J. Comb. 91: 103203 (2021) - [j44]Daphne Der-Fen Liu, Laxman Saha, Satyabrata Das:
Improved lower bounds for the radio number of trees. Theor. Comput. Sci. 851: 1-13 (2021) - [j43]Devsi Bantva, Daphne Der-Fen Liu:
Optimal radio labellings of block graphs and line graphs of trees. Theor. Comput. Sci. 891: 90-104 (2021) - [i1]Devsi Bantva, Daphne Der-Fen Liu:
Optimal Radio Labellings of Block Graphs and Line Graphs of Trees. CoRR abs/2108.12754 (2021) - 2020
- [j42]Daphne Der-Fen Liu, Grant Robinson:
Sequences of integers with three missing separations. Eur. J. Comb. 85 (2020)
2010 – 2019
- 2019
- [j41]Yiting Jiang, Daphne Der-Fen Liu, Yeong-Nan Yeh, Xuding Zhu:
Colouring of generalized signed triangle-free planar graphs. Discret. Math. 342(3): 836-843 (2019) - 2018
- [j40]Daphne Der-Fen Liu, Ziyu Hu, Ko-Wei Lih:
Upper bounds for the strong chromatic index of Halin graphs. Discuss. Math. Graph Theory 38(1): 5-26 (2018) - 2016
- [j39]Daphne Der-Fen Liu, Xuding Zhu:
A combinatorial proof for the circular chromatic number of Kneser graphs. J. Comb. Optim. 32(3): 765-774 (2016) - 2014
- [j38]Yuehua Bu, Stephen Finbow, Daphne Der-Fen Liu, Xuding Zhu:
List backbone colouring of graphs. Discret. Appl. Math. 167: 45-51 (2014) - [c1]Daniel Collister, Daphne Der-Fen Liu:
Study of \kappa (D) for D = 2, 3, x, y. IWOCA 2014: 250-261 - 2013
- [j37]Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu:
Backbone coloring for graphs with large girths. Discret. Math. 313(18): 1799-1804 (2013) - [j36]Daphne Der-Fen Liu, Aileen Sutedja:
Chromatic number of distance graphs generated by the sets {2, 3, x, y}. J. Comb. Optim. 25(4): 680-693 (2013) - [j35]Gerard Jennhwa Chang, Daphne Der-Fen Liu, Xuding Zhu:
A short proof for Chen's Alternative Kneser Coloring Lemma. J. Comb. Theory A 120(1): 159-163 (2013) - 2012
- [j34]Ko-Wei Lih, Daphne Der-Fen Liu:
On the strong chromatic index of cubic Halin graphs. Appl. Math. Lett. 25(5): 898-901 (2012) - [j33]Justie Su-tzu Juan, Daphne Der-Fen Liu:
Antipodal Labelings for Cycles. Ars Comb. 103: 81-96 (2012) - [j32]Seog-Jin Kim, Young Soo Kwon, Daphne Der-Fen Liu, Xuding Zhu:
On-Line List Colouring of Complete Multipartite Graphs. Electron. J. Comb. 19(1): 41 (2012) - [j31]Gerard Jennhwa Chang, Daphne Der-Fen Liu:
Strong edge-coloring for cubic Halin graphs. Discret. Math. 312(8): 1468-1475 (2012) - 2011
- [j30]Daphne Der-Fen Liu:
Hamiltonian Spectra of Trees. Ars Comb. 99: 415-419 (2011) - [j29]Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. J. Graph Theory 67(3): 178-197 (2011) - 2010
- [j28]Justie Su-tzu Juan, Daphne Der-Fen Liu, Li-Yueh Chen:
L(j, k)-labelling and maximum ordering-degrees for trees. Discret. Appl. Math. 158(6): 692-698 (2010) - [j27]Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. J. Graph Theory 63(4): 311-323 (2010)
2000 – 2009
- 2009
- [j26]Daphne Der-Fen Liu, Melanie Xie:
Radio Number for Square Paths. Ars Comb. 90 (2009) - [j25]Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang:
On (d, 1)-total numbers of graphs. Discret. Math. 309(12): 3767-3773 (2009) - 2008
- [j24]Daphne Der-Fen Liu:
Radio number for trees. Discret. Math. 308(7): 1153-1164 (2008) - [j23]Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian sum of graphs. Discret. Math. 308(24): 5928-5936 (2008) - [j22]Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number of distance graphs generated by two-interval sets. Eur. J. Comb. 29(7): 1733-1743 (2008) - 2005
- [j21]Daphne Der-Fen Liu, Xuding Zhu:
Coloring the Cartesian Sum of Graphs. Electron. Notes Discret. Math. 22: 305-309 (2005) - [j20]Daphne Der-Fen Liu, Xuding Zhu:
Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" Journal of Graph Theory 47(2) 2004, 129-146. J. Graph Theory 48(4): 329-330 (2005) - [j19]Daphne Der-Fen Liu, Xuding Zhu:
Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs. SIAM J. Discret. Math. 19(2): 281-293 (2005) - [j18]Daphne Der-Fen Liu, Xuding Zhu:
Multilevel Distance Labelings for Paths and Cycles. SIAM J. Discret. Math. 19(3): 610-621 (2005) - 2004
- [j17]Daphne Der-Fen Liu:
Circular chromatic number for iterated Mycielski graphs. Discret. Math. 285(1-3): 335-340 (2004) - [j16]Daphne Der-Fen Liu, Xuding Zhu:
Fractional chromatic number and circular chromatic number for distance graphs with large clique size. J. Graph Theory 47(2): 129-146 (2004) - 2003
- [j15]Daphne Der-Fen Liu:
Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings. Ars Comb. 67 (2003) - [j14]Daphne Der-Fen Liu, Xuding Zhu:
Circulant Distant Two Labeling and Circular Chromatic Number. Ars Comb. 69 (2003) - 2002
- [j13]Daphne Der-Fen Liu, Xuding Zhu:
Asymptotic Clique Covering Ratios of Distance Graphs. Eur. J. Comb. 23(3): 315-327 (2002) - [j12]Ko-Wei Lih, Daphne Der-Fen Liu:
Circular chromatic numbers of some reduced Kneser graphs. J. Graph Theory 41(1): 62-68 (2002) - 2001
- [j11]Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
No-hole 2-distant colorings for unit interval graphs. Ars Comb. 61 (2001) - [j10]Daphne Der-Fen Liu:
Hamiltonicity and circular distance two labellings. Discret. Math. 232(1-3): 163-169 (2001) - [j9]Gerard J. Chang, Justie Su-tzu Juan, Daphne Der-Fen Liu:
Minimum Span of No-Hole (r+1)-Distant Colorings. SIAM J. Discret. Math. 14(3): 370-380 (2001) - 2000
- [j8]Daphne Der-Fen Liu:
T-Colorings and Chromatic Number of Distance Graphs. Ars Comb. 56 (2000) - [j7]Gerard J. Chang, Wen-Tsai Ke, David Kuo, Daphne Der-Fen Liu, Roger K. Yeh:
On L(d, 1)-labelings of graphs. Discret. Math. 220(1-3): 57-66 (2000)
1990 – 1999
- 1999
- [j6]Gerard J. Chang, Daphne Der-Fen Liu, Xuding Zhu:
Distance Graphs and T-Coloring. J. Comb. Theory B 75(2): 259-269 (1999) - [j5]Daphne Der-Fen Liu, Xuding Zhu:
Distance graphs with missing multiples in the distance sets. J. Graph Theory 30(4): 245-259 (1999) - [j4]Ko-Wei Lih, Daphne Der-Fen Liu, Xuding Zhu:
Star Extremal Circulant Graphs. SIAM J. Discret. Math. 12(4): 491-499 (1999) - 1997
- [j3]Daphne Der-Fen Liu, Roger K. Yeh:
On Distance Two Labellings of Graphs. Ars Comb. 47 (1997) - 1996
- [j2]Daphne Der-Fen Liu:
T-graphs and the channel assignment problem. Discret. Math. 161(1-3): 197-205 (1996) - 1992
- [j1]Daphne Der-Fen Liu:
T-colorings of graphs. Discret. Math. 101(1-3): 203-212 (1992)
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-09-10 01:17 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:
