 | 2011 |
|---|
| 8 |       | Ziming Duan,
Pingli Lv,
Lianying Miao,
Zhengke Miao,
Cuiqi Wang:
The Δ2-conjecture for L(2, 1)-labelings is true for total graphs.
Appl. Math. Lett. 24(9): 1491-1494 (2011) |
| 7 | | Lianying Miao,
Jibin Qu,
Qingbo Sun:
On the average degree of critical graphs with maximum degree six.
Discrete Mathematics 311(21): 2574-2576 (2011) |
| 6 | | Ziming Duan,
Pingli Lv,
Lianying Miao,
Zhengke Miao,
Cuiqi Wang:
New upper bounds on the L(2, 1)-labeling of the skew and converse skew product graphs.
Theor. Comput. Sci. 412(22): 2393-2397 (2011) |
| 2010 |
|---|
| 5 | | Lianying Miao,
Qingbo Sun:
On the size of critical graphs with maximum degree 8.
Discrete Mathematics 310(15-16): 2215-2218 (2010) |
| 2009 |
|---|
| 4 | | Hong-Jian Lai,
Lianying Miao,
Yehong Shao:
Every line graph of a 4-edge-connected graph is I-connected.
Eur. J. Comb. 30(2): 595-601 (2009) |
| 3 | | Rong Luo,
Lianying Miao,
Yue Zhao:
The size of edge chromatic critical graphs with maximum degree 6.
Journal of Graph Theory 60(2): 149-171 (2009) |
| 2008 |
|---|
| 2 | | Lianying Miao,
Shiyou Pang:
On the size of edge-coloring critical graphs with maximum degree 4.
Discrete Mathematics 308(23): 5856-5859 (2008) |
| 2006 |
|---|
| 1 |  | Xianyong Meng,
Lianying Miao,
Bentang Su,
Rensuo Li:
The Dynamic Coloring Numbers of Pseudo-Halin Graphs.
Ars Comb. 79: (2006) |
Data released under the ODC-BY 1.0 license — See also our legal information page