The following pages link to Weifan Wang (Q977288):
Displaying 50 items.
- (Q192843) (redirect page) (← links)
- The entire choosability of plane graphs (Q266053) (← links)
- The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
- A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs (Q288235) (← links)
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- The vertex version of weighted Wiener number for bicyclic molecular structures (Q305652) (← links)
- A \((3,1)^\ast\)-choosable theorem on planar graphs (Q326497) (← links)
- Linear coloring of planar graphs without 4-cycles (Q354457) (← links)
- Class I graphs of nonnegative characteristic without special cycles (Q377914) (← links)
- The 2-surviving rate of planar graphs without 6-cycles (Q391779) (← links)
- The surviving rate of digraphs (Q396728) (← links)
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
- (2,1)-total number of joins of paths and cycles (Q424617) (← links)
- On backbone coloring of graphs (Q434190) (← links)
- Acyclic chromatic indices of planar graphs with girth at least five (Q434197) (← links)
- On the vertex-arboricity of planar graphs without 7-cycles (Q442319) (← links)
- An improved bound on parity vertex colourings of outerplane graphs (Q449117) (← links)
- Planar graphs of maximum degree six without 7-cycles are class one (Q456339) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Adjacent vertex distinguishing indices of planar graphs without 3-cycles (Q482220) (← links)
- Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five (Q489739) (← links)
- A note on the linear 2-arboricity of planar graphs (Q526220) (← links)
- The eccentric connectivity polynomial of two classes of nanotubes (Q528402) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- The surviving rate of an outerplanar graph for the firefighter problem (Q627197) (← links)
- Entire colouring of plane graphs (Q651038) (← 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)
- The surviving rate of an infected network (Q708218) (← links)
- The 2-surviving rate of planar graphs without 4-cycles (Q714853) (← links)
- On choosability with separation of planar graphs without adjacent short cycles (Q723623) (← links)
- 2-distance vertex-distinguishing index of subcubic graphs (Q724740) (← links)
- An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph (Q741759) (← links)
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- The surviving rate of planar graphs (Q764317) (← links)
- Entire chromatic number and \(\Delta\)-matching of outerplane graphs (Q815128) (← links)
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- An improved upper bound on the linear 2-arboricity of 1-planar graphs (Q831027) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability (Q854811) (← links)
- Edge choosability of planar graphs without short cycles (Q880873) (← links)
- Adjacent vertex distinguishing total coloring of graphs with lower average degree (Q947049) (← links)
- Labelling planar graphs without 4-cycles with a condition on distance two (Q947103) (← links)
- A relaxation of Havel's 3-color problem (Q963412) (← links)
- Adjacent vertex distinguishing total colorings of outerplanar graphs (Q965812) (← links)
- (2,1)-total labelling of trees with sparse vertices of maximum degree (Q976073) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree (Q987498) (← links)
- \((2,1)\)-Total number of trees with maximum degree three (Q989489) (← links)
