The following pages link to Yi Qiao Wang (Q831026):
Displaying 50 items.
- (Q266052) (redirect page) (← links)
- The entire choosability of plane graphs (Q266053) (← links)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- An improved upper bound on the linear 2-arboricity of planar graphs (Q501025) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- A note on the linear 2-arboricity of planar graphs (Q526220) (← links)
- Adjacent vertex-distinguishing edge colorings of \(K_{4}\)-minor free graphs (Q654244) (← links)
- A new upper bound on the acyclic chromatic indices of planar graphs (Q691588) (← links)
- An improved upper bound on the linear 2-arboricity of 1-planar graphs (Q831027) (← links)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree (Q947049) (← links)
- Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- A sufficient condition for planar graphs to be (3,1)-choosable (Q1679498) (← links)
- Neighbor-sum-distinguishing edge choosability of subcubic graphs (Q1680485) (← links)
- Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
- Linear 2-arboricity of toroidal graphs (Q1714033) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- A characterization for the neighbor-distinguishing total chromatic number of planar graphs with \(\varDelta = 13\) (Q1783617) (← links)
- A note on the list vertex arboricity of toroidal graphs (Q1800404) (← links)
- Acyclic list edge coloring of outerplanar graphs (Q1928452) (← links)
- Acyclic edge coloring of planar graphs without 4-cycles (Q1956244) (← links)
- Star edge-coloring of graphs with maximum degree four (Q2007679) (← links)
- On the neighbor-distinguishing indices of planar graphs (Q2117565) (← links)
- Two sufficient conditions for a planar graph to be list vertex-2-arborable (Q2124649) (← links)
- Strict neighbor-distinguishing total index of graphs (Q2131155) (← links)
- Computation on the difference of Zagreb indices of maximal planar graphs with diameter two (Q2177877) (← links)
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable (Q2185811) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← links)
- List coloring and diagonal coloring for plane graphs of diameter two (Q2286099) (← links)
- Neighbor-distinguishing total coloring of planar graphs with maximum degree twelve (Q2292141) (← links)
- Light structures in 1-planar graphs with an application to linear 2-arboricity (Q2322876) (← links)
- Acyclic coloring of IC-planar graphs (Q2329208) (← links)
- Edge-partition and star chromatic index (Q2335139) (← links)
- Equitable total-coloring of subcubic graphs (Q2341763) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
- Edge coloring of graphs embedded in a surface of nonnegative characteristic (Q2401779) (← links)
- The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) (← links)
- Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle (Q2444561) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
