The following pages link to Weifan Wang (Q977288):
Displaying 50 items.
- An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 (Q2099458) (← 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)
- Surviving rate of graphs and firefighter problem (Q2141321) (← links)
- A sufficient condition for a planar graph to be \((\mathcal{F},\mathcal{F}_2)\)-partitionable (Q2146740) (← links)
- Adjacent vertex distinguishing edge coloring of planar graphs without 4-cycles (Q2186285) (← links)
- Two-distance vertex-distinguishing index of sparse subcubic graphs (Q2186287) (← links)
- An improved upper bound for the acyclic chromatic number of 1-planar graphs (Q2192086) (← links)
- Tight binding number bound for \(P_{\geq 3}\)-factor uniform graphs (Q2234788) (← links)
- Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← links)
- Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
- Choosability with separation of planar graphs without prescribed cycles (Q2284787) (← 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)
- \((2,1)\)-total labeling of trees with large maximum degree (Q2348054) (← links)
- Some bounds on the neighbor-distinguishing index of graphs (Q2352066) (← links)
- A new sufficient condition for a tree \(T\) to have the \((2,1)\)-total number \(\Delta +1\) (Q2359803) (← links)
- On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
- Improper choosability of graphs of nonnegative characteristic (Q2389752) (← 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)
- On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree (Q2423361) (← links)
- Planar graphs with \(\Delta =9\) are neighbor-distinguishing totally 12-colorable (Q2424665) (← links)
- On the vertex-arboricity of planar graphs (Q2427551) (← links)
- The adjacent vertex distinguishing total coloring of planar graphs (Q2444142) (← 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)
- A sufficient condition for a planar graph to be class I (Q2456359) (← links)
- On 3-colorable planar graphs without prescribed cycles (Q2461207) (← links)
- \((2,1)\)-total labelling of outerplanar graphs (Q2462398) (← links)
- Coloring the square of an outerplanar graph (Q2472571) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- Bordeaux 3-color conjecture and 3-choosability (Q2488930) (← links)
- The \(L(2,1)\)-labelling of trees (Q2489954) (← links)
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1 (Q2497482) (← links)
- Edge-face chromatic number of 2-connected plane graphs with high maximum degree (Q2507633) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Strict neighbor-distinguishing index of subcubic graphs (Q2657091) (← links)
- Entire coloring of 2-connected plane graphs (Q2662784) (← links)
- Neighbor-distinguishing indices of planar graphs with maximum degree ten (Q2686132) (← links)
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs (Q2686134) (← links)
- Local neighbor-distinguishing index of graphs (Q2693079) (← links)
- 2-distance choosability of planar graphs with a restriction for maximum degree (Q2698256) (← links)
- The complete chromatic number of some planar graphs (Q2715347) (← links)
- Entire chromatic number of outerplane graphs with maximum degree four (Q2720839) (← links)
