The following pages link to Daphne Der-Fen Liu (Q189455):
Displaying 50 items.
- A combinatorial proof for the circular chromatic number of Kneser graphs (Q326473) (← links)
- Backbone coloring for graphs with large girths (Q385734) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- On-line list colouring of complete multipartite graphs (Q426807) (← links)
- Fractional chromatic number of distance graphs generated by two-interval sets (Q942143) (← links)
- From rainbow to the lonely runner: A survey on coloring parameters of distances graphs (Q947038) (← links)
- \(L(j,k)\)-labelling and maximum ordering-degrees for trees (Q968198) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- On \((d,1)\)-total numbers of graphs (Q1043541) (← links)
- \(T\)-colorings of graphs (Q1197028) (← links)
- (Q1305533) (redirect page) (← links)
- Distance graphs and \(T\)-coloring (Q1305534) (← links)
- The channel assignment problem for mutually adjacent sites (Q1336445) (← links)
- \(T\)-graphs and the channel assignment problem (Q1356423) (← links)
- Asymptotic clique covering ratios of distance graphs (Q1612760) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- Colouring of generalized signed triangle-free planar graphs (Q1712532) (← links)
- A short proof for Chen's alternative Kneser coloring lemma (Q1758510) (← links)
- Circular chromatic number for iterated Mycielski graphs (Q1877680) (← links)
- Chromatic number of distance graphs generated by the sets \(\{2,3,x,y\}\) (Q1956238) (← links)
- Radio-\(k\)-labeling of cycles for large \(k\) (Q2143046) (← links)
- Improved lower bounds for the radio number of trees (Q2220806) (← links)
- Optimal radio-\(k\)-labelings of trees (Q2225407) (← links)
- Optimal radio labellings of block graphs and line graphs of trees (Q2235749) (← links)
- Sequences of integers with three missing separations (Q2297912) (← links)
- List backbone colouring of graphs (Q2440098) (← links)
- Radio number for trees (Q2469993) (← links)
- Antimagic labeling for unions of graphs with many three-paths (Q2699924) (← links)
- Minimum Span of No-Hole (<i>r</i>+1)-Distant Colorings (Q2753531) (← links)
- (Q2918640) (← links)
- Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ (Q2946061) (← links)
- Circular consecutive choosability of k-choosable graphs (Q3018072) (← links)
- (Q3073573) (← links)
- Circular chromatic numbers of some reduced Kneser graphs (Q3150176) (← links)
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size (Q3159396) (← links)
- Coloring the Cartesian Sum of Graphs (Q3439356) (← links)
- Multi-coloring the Mycielskian of graphs (Q3553236) (← links)
- (Q4238040) (← links)
- (Q4503967) (← links)
- (Q4552213) (← links)
- (Q4677958) (← links)
- Star Extremal Circulant Graphs (Q4699173) (← links)
- (Q4863459) (← links)
- (Q4897468) (← links)
- (Q4940064) (← links)
- (Q4949774) (← links)
- Distance Graphs Generated by Five Primes (Research) (Q5118660) (← links)
- (Q5461468) (← links)
- (Q5463346) (← links)
