The following pages link to Lian-Ying Miao (Q271645):
Displaying 50 items.
- Element deletion changes in dynamic coloring of graphs (Q271647) (← links)
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- (Q345625) (redirect page) (← links)
- Outer synchronization of uncertain complex delayed networks with noise coupling (Q345627) (← links)
- \(L(p,2,1)\)-labeling of the infinite regular trees (Q393463) (← links)
- On the average degree of critical graphs with maximum degree six (Q409377) (← links)
- Generation of lag outer synchronization of complex networks with noise coupling (Q493944) (← links)
- New upper bounds on the \(L(2,1)\)-labeling of the skew and converse skew product graphs (Q533885) (← links)
- The \(\Delta ^{2}\)-conjecture for \(L(2,1)\)-labelings is true for total graphs (Q548395) (← links)
- Edge covering coloring and fractional edge covering coloring (Q698408) (← links)
- (Q741238) (redirect page) (← links)
- The distance coloring of graphs (Q741239) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- On the extremal values of the eccentric distance sum of trees with a given maximum degree (Q777408) (← links)
- On the size of critical graphs with maximum degree 8 (Q982631) (← links)
- On the size of edge-coloring critical graphs with maximum degree 4 (Q998479) (← links)
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (Q1003612) (← links)
- (Q1408889) (redirect page) (← links)
- An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree (Q1408892) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Edge-coloring critical graphs with high degree (Q1850002) (← links)
- Neighbor sum distinguishing total coloring of triangle free IC-planar graphs (Q1987570) (← links)
- On the extremal values of the eccentric distance sum of trees with a given domination number (Q2012062) (← links)
- Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
- \(2\)-distance coloring of planar graphs with maximum degree \(5\) (Q2075520) (← links)
- Acyclic choosability of graphs with bounded degree (Q2119462) (← links)
- The general Albertson irregularity index of graphs (Q2129702) (← links)
- List 2-distance coloring of planar graphs with girth five (Q2155644) (← links)
- Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance (Q2172398) (← links)
- Acyclic coloring of claw-free graphs with small degree (Q2172408) (← links)
- Neighbor sum distinguishing total coloring of IC-planar graphs (Q2185920) (← links)
- The \(A_\alpha\)-spread of a graph (Q2199343) (← links)
- Characterization of graphs with an eigenvalue of large multiplicity (Q2246527) (← links)
- Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 (Q2279264) (← links)
- Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
- On signed star domination in graphs (Q2316311) (← links)
- Acyclic coloring of graphs with maximum degree at most six (Q2324491) (← links)
- Acyclic vertex coloring of graphs of maximum degree six (Q2449135) (← links)
- On the independence number of edge chromatic critical graphs (Q2509546) (← links)
- Acyclic coloring of graphs with maximum degree 7 (Q2657099) (← links)
- Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable (Q2671068) (← links)
- On graphs of order \(n\) with metric dimension \(n-4\) (Q2689112) (← links)
- Coloring squares of planar graphs with maximum degree at most five (Q2689129) (← links)
- On \(L (p, q)\)-labelling of planar graphs without cycles of length four (Q2698183) (← links)
- (Q2779049) (← links)
- (Q2860830) (← links)
- (Q2881280) (← links)
- Maximal matching and edge domination in complete multipartite graphs (Q2921894) (← links)
- 最大度为8不含相邻4-圈的1-平面图边色数 (Q2924779) (← links)
- On the size of critical graphs with small maximum degree (Q2931953) (← links)
