The following pages link to Weifan Wang (Q977288):
Displaying 50 items.
- A characterization of the entire chromatic number of plane graphs with high maximum degree (Q2721791) (← links)
- Equitable colorings of line graphs and complete \(r\)-partite graphs (Q2721926) (← links)
- The 4-choosability of planar graphs without 6-cycles (Q2760437) (← links)
- Light 3-faces of plane graphs without 6-cycles (Q2764880) (← links)
- Colorings of hypergraphs (Q2767358) (← links)
- Toughness and fractional critical deleted graph (Q2811832) (← links)
- Full orientability of the square of a cycle. (Q2823213) (← links)
- Distance vertex-distinguishing index of outerplanar graphs (Q2824704) (← links)
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least four (Q2858736) (← links)
- Fault tolerant path-embedding in locally twisted cubes. (Q2864437) (← links)
- A note on general neighbor-distinguishing total coloring of graphs. (Q2864467) (← links)
- Vertex arboricity of planar graphs without chordal 6-cycles (Q2868169) (← links)
- Acyclic chromatic indices of 2-outerplane graphs (Q2918048) (← links)
- Equitable coloring of planar graphs without 4-and 5-cycles (Q2923653) (← links)
- Structural properties and surviving rate of planar graphs (Q2931915) (← links)
- New isolated toughness condition for fractional $(g,f,n)$-critical graphs (Q2966787) (← links)
- A characterization of L(2, 1)-labeling number for trees with maximum degree 3 (Q2983505) (← links)
- The surviving rate of some oriented planar graphs (Q2987309) (← links)
- (Q3017068) (← links)
- (Q3051721) (← links)
- Choosability of toroidal graphs without short cycles (Q3055923) (← links)
- (Q3070238) (← links)
- Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six (Q3092678) (← links)
- (Q3109526) (← links)
- (Q3134386) (← links)
- (Q3170099) (← links)
- (Q3380750) (← links)
- (Q3385073) (← links)
- (Q3404683) (← links)
- (Q3408834) (← links)
- (Q3415464) (← links)
- Total chromatic number of planar graphs with maximum degree ten (Q3422127) (← links)
- (Q3424893) (← links)
- Acyclic 5-choosability of planar graphs without small cycles (Q3427375) (← links)
- A Characterization on the Adjacent Vertex Distinguishing Index of Planar Graphs with Large Maximum Degree (Q3461985) (← links)
- Legally $$(\varDelta +2)$$ ( Δ + 2 ) -Coloring Bipartite Outerplanar Graphs in Cubic Time (Q3467875) (← links)
- (Q3577602) (← links)
- (Q3611292) (← links)
- (Q3611309) (← links)
- (Q3641986) (← links)
- Planar graphs without 4-cycles are acyclically 6-choosable (Q3652536) (← links)
- Star coloring of sparse graphs (Q3652552) (← links)
- (Q4031964) (← links)
- (Q4222088) (← links)
- (Q4235218) (← links)
- (Q4278795) (← links)
- Labeling Planar Graphs with Conditions on Girth and Distance Two (Q4443137) (← links)
- (Q4505766) (← links)
- (Q4518368) (← links)
- (Q4528373) (← links)
