The following pages link to Weifan Wang (Q977288):
Displaying 50 items.
- (Q4558644) (← links)
- Degree sum condition for fractional ID-$k$-factor-critical graphs (Q4608384) (← links)
- 2-distance vertex-distinguishing total coloring of graphs (Q4634521) (← links)
- (Q4680036) (← links)
- (Q4783125) (← links)
- Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles (Q4785700) (← links)
- Edge-partitions of planar graphs and their game coloring numbers (Q4798121) (← links)
- (Q4898317) (← links)
- (Q4900950) (← links)
- 6-Star-Coloring of Subcubic Graphs (Q4908828) (← links)
- (Q4926543) (← links)
- The fifth geometric-arithmetic index of bridge graph and carbon nanocones (Q4978246) (← links)
- (Q4982898) (← links)
- (Q4982903) (← links)
- (Q4990127) (← links)
- (Q4998153) (← links)
- IC-Planar Graphs Are 6-Choosable (Q5009330) (← links)
- 最大度为6 的平面图为第一类的一个新充分条件 (Q5017565) (← links)
- Acyclic chromatic indices of <italic>K</italic><sub>4</sub>-minor free graphs (Q5017686) (← links)
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree (Q5017728) (← links)
- Analysis of <i>k</i>-partite ranking algorithm in area under the receiver operating characteristic curve criterion (Q5028602) (← links)
- 子立方平面图的$(1,0)$-松弛强边列表染色 (Q5037961) (← links)
- Adjacent vertex distinguishing index of bipartite planar graphs (Q5063732) (← links)
- Edge-face coloring of 2-connected plane graphs (Q5063962) (← links)
- A local condition for planar graphs to be 4-choosable (Q5064122) (← links)
- Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable (Q5066912) (← links)
- On the arithmetic-geometric index of graphs (Q5165196) (← links)
- (Q5173708) (← links)
- Planar Graphs with $\Delta\ge 9$ are Entirely $(\Delta+2)$-Colorable (Q5246090) (← links)
- (Q5320577) (← links)
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 (Q5325950) (← links)
- A tight neighborhood union condition on fractional $(g,f,n’,m)$-critical deleted graphs (Q5368834) (← links)
- Coupled choosability of plane graphs (Q5387055) (← links)
- (Q5403010) (← links)
- (Q5463507) (← links)
- (Q5492304) (← links)
- On Neighbor-Distinguishing Index of Planar Graphs (Q5495886) (← links)
- (Q5496752) (← links)
- (Q5496754) (← links)
- (Q5498278) (← links)
- (Q5501171) (← links)
- (Q5700754) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 3-cycles (Q5858150) (← links)
- Toughness condition for a graph to be all fractional (g,f,n)-critical deleted (Q5863628) (← links)
- Acyclic 5-choosability of planar graphs without 4-cycles (Q5901353) (← links)
- Injective coloring of planar graphs (Q5902135) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)
- A seven-color theorem on edge-face coloring of plane graphs (Q5946678) (← links)
- A sufficient condition for a tree to be \((\Delta+1)\)-\((2,1)\)-totally labelable (Q5963659) (← links)
- Rainbow cliques in edge-colored graphs (Q5964266) (← links)
