Daphne Der-Fen Liu

Orcid: 0000-0001-8988-2916

According to our database1, Daphne Der-Fen Liu authored at least 48 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Radio number for the Cartesian product of two trees.
Discret. Appl. Math., January, 2024

2023
Antimagic labeling for unions of graphs with many three-paths.
Discret. Math., June, 2023

2022
Radio-k-labeling of cycles for large k.
Discret. Appl. Math., 2022

2021
Improved lower bounds for the radio number of trees.
Theor. Comput. Sci., 2021

Optimal radio labellings of block graphs and line graphs of trees.
Theor. Comput. Sci., 2021

Optimal radio-k-labelings of trees.
Eur. J. Comb., 2021

2020
Sequences of integers with three missing separations.
Eur. J. Comb., 2020

2019
Colouring of generalized signed triangle-free planar graphs.
Discret. Math., 2019

2018
Upper bounds for the strong chromatic index of Halin graphs.
Discuss. Math. Graph Theory, 2018

2016
A combinatorial proof for the circular chromatic number of Kneser graphs.
J. Comb. Optim., 2016

2014
List backbone colouring of graphs.
Discret. Appl. Math., 2014

Study of \kappa (D) for D = 2, 3, x, y.
Proceedings of the Combinatorial Algorithms - 25th International Workshop, 2014

2013
A short proof for Chen's Alternative Kneser Coloring Lemma.
J. Comb. Theory, Ser. A, 2013

Chromatic number of distance graphs generated by the sets {2, 3, x, y}.
J. Comb. Optim., 2013

Backbone coloring for graphs with large girths.
Discret. Math., 2013

2012
Strong edge-coloring for cubic Halin graphs.
Discret. Math., 2012

On-Line List Colouring of Complete Multipartite Graphs.
Electron. J. Comb., 2012

Antipodal Labelings for Cycles.
Ars Comb., 2012

On the strong chromatic index of cubic Halin graphs.
Appl. Math. Lett., 2012

2011
Circular consecutive choosability of <i>k</i>-choosable graphs.
J. Graph Theory, 2011

Hamiltonian Spectra of Trees.
Ars Comb., 2011

2010
Multi-coloring the Mycielskian of graphs.
J. Graph Theory, 2010

L(j, k)-labelling and maximum ordering-degrees for trees.
Discret. Appl. Math., 2010

2009
On (d, 1)-total numbers of graphs.
Discret. Math., 2009

Radio Number for Square Paths.
Ars Comb., 2009

2008
Fractional chromatic number of distance graphs generated by two-interval sets.
Eur. J. Comb., 2008

Radio number for trees.
Discret. Math., 2008

2005
Multilevel Distance Labelings for Paths and Cycles.
SIAM J. Discret. Math., 2005

Circular Distance Two Labeling and the lambda-Number for Outerplanar Graphs.
SIAM J. Discret. Math., 2005

Erratum to: "Fractional chromatic number and circular chromatic number for distance graphs with large clique size" <i>Journal of Graph Theory</i> 47(2) 2004, 129-146.
J. Graph Theory, 2005

Coloring the Cartesian Sum of Graphs.
Electron. Notes Discret. Math., 2005

2004
Fractional chromatic number and circular chromatic number for distance graphs with large clique size.
J. Graph Theory, 2004

Circular chromatic number for iterated Mycielski graphs.
Discret. Math., 2004

2003
Circulant Distant Two Labeling and Circular Chromatic Number.
Ars Comb., 2003

Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings.
Ars Comb., 2003

2002
Circular chromatic numbers of some reduced Kneser graphs.
J. Graph Theory, 2002

Asymptotic Clique Covering Ratios of Distance Graphs.
Eur. J. Comb., 2002

2001
Minimum Span of No-Hole (r+1)-Distant Colorings.
SIAM J. Discret. Math., 2001

Hamiltonicity and circular distance two labellings.
Discret. Math., 2001

No-hole 2-distant colorings for unit interval graphs.
Ars Comb., 2001

2000
On <i>L</i>(<i>d</i>, 1)-labelings of graphs.
Discret. Math., 2000

T-Colorings and Chromatic Number of Distance Graphs.
Ars Comb., 2000

1999
Star Extremal Circulant Graphs.
SIAM J. Discret. Math., 1999

Distance graphs with missing multiples in the distance sets.
J. Graph Theory, 1999

Distance Graphs and T-Coloring.
J. Comb. Theory, Ser. B, 1999

1997
On Distance Two Labellings of Graphs.
Ars Comb., 1997

1996
T-graphs and the channel assignment problem.
Discret. Math., 1996

1992
T-colorings of graphs.
Discret. Math., 1992


  Loading...