Jian-Bo Lv

According to our database, Jian-Bo Lv authored at least 13 papers between 2014 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable.

Xiangwen Li, Jie Liu, Jian-Bo Lv

Graphs Comb., December, 2023

Strong edge-colorings of sparse graphs with 3Δ - 1 colors.

Xiangwen Li, Yangfan Li, Jian-Bo Lv, Tao Wang

Inf. Process. Lett., 2023

Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest.

Xiaojie Huang, Ziwen Huang, Jian-Bo Lv

Graphs Comb., 2023

2022

On Strong Edge-Coloring of Claw-Free Subcubic Graphs.

Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang

Graphs Comb., 2022

Planar Graphs Without Cycles of Length from 4 to 7 and Intersecting Triangles are DP-3-Colorable.

Jian-Bo Lv

Graphs Comb., 2022

DP-4-colorability of planar graphs without intersecting 5-cycles.

Xiangwen Li, Jian-Bo Lv, Mao Zhang

Discret. Math., 2022

Every planar graph with girth at least 5 is (1, 9)-colorable.

Xiangwen Li, Jie Liu, Jian-Bo Lv

Discret. Math., 2022

Upper bound for DP-chromatic number of a graph.

Jian-Bo Lv, Jianxi Li, Ziwen Huang

Discret. Appl. Math., 2022

2021

List injective edge-coloring of subcubic graphs.

Jian-Bo Lv, Jianxi Li, Nian Hong Zhou

Discret. Appl. Math., 2021

2020

The harmonic index of a graph and its DP-chromatic number.

Jian-Bo Lv, Jianxi Li

Discret. Appl. Math., 2020

2018

On strong edge-coloring of graphs with maximum degree 4.

Jian-Bo Lv, Xiangwen Li, Gexin Yu

Discret. Appl. Math., 2018

On the harmonic index of quasi-tree graphs.

Jian-Bo Lv

Ars Comb., 2018

2014

On the harmonic index and the matching number of a tree.

Jian-Bo Lv, Jianxi Li

Ars Comb., 2014