The following pages link to Jian-Bo Lv (Q726525):
Displaying 24 items.
- The harmonic index of some graphs (Q726527) (← links)
- The harmonic index of a graph and its DP-chromatic number (Q777446) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Extremal values for the variation of the Randić index of bicyclic graphs (Q1983266) (← links)
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
- List injective edge-coloring of subcubic graphs (Q2043370) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- DP-\(4\)-colorability of planar graphs without intersecting \(5\)-cycles (Q2075538) (← links)
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors (Q2094384) (← links)
- Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest (Q2112310) (← links)
- On strong edge-coloring of claw-free subcubic graphs (Q2117528) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Upper bound for DP-chromatic number of a graph (Q2143040) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Notes on the harmonic index of graphs (Q2678296) (← links)
- (Q2815710) (← links)
- The harmonic index of unicyclic graphs with given matching number (Q2975275) (← links)
- (Q3447618) (← links)
- (Q4568174) (← links)
- (Q4576361) (← links)
- (Q5071558) (← links)
- Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable (Q6081925) (← links)
- Partition line graphs of multigraphs into two subgraphs with large chromatic numbers (Q6153466) (← links)
- Note on the number of ordered \(k\)-partitions of multiset \(M_d[n]\) with equal sums (Q6159757) (← links)