default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJian-Bo Lv
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j16]Jiacong Fu, Jian-Bo Lv:
On injective edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 360: 119-130 (2025)- 2024
- [j15]Jian-Bo Lv, Jianxi Li:
Partition line graphs of multigraphs into two subgraphs with large chromatic numbers. Discret. Appl. Math. 346: 44-48 (2024) - [j14]Jian-Bo Lv, Jiacong Fu, Jianxi Li:
Injective Chromatic Index of K4-Minor Free Graphs. Graphs Comb. 40(4): 77 (2024) - 2023
- [j13]Xiaojie Huang, Ziwen Huang, Jian-Bo Lv:
Partitioning Planar Graphs without 4-Cycles and 6-Cycles into a Linear Forest and a Forest. Graphs Comb. 39(1): 10 (2023) - [j12]Xiangwen Li
, Jie Liu, Jian-Bo Lv:
Every planar graph without 4-cycles and 5-cycles is (3,3)-colorable. Graphs Comb. 39(6): 118 (2023) - [j11]Xiangwen Li, Yangfan Li, Jian-Bo Lv, Tao Wang:
Strong edge-colorings of sparse graphs with 3Δ - 1 colors. Inf. Process. Lett. 179: 106313 (2023) - 2022
- [j10]Jian-Bo Lv, Jianxi Li, Ziwen Huang:
Upper bound for DP-chromatic number of a graph. Discret. Appl. Math. 316: 28-32 (2022) - [j9]Xiangwen Li, Jian-Bo Lv, Mao Zhang:
DP-4-colorability of planar graphs without intersecting 5-cycles. Discret. Math. 345(4): 112790 (2022) - [j8]Xiangwen Li, Jie Liu, Jian-Bo Lv:
Every planar graph with girth at least 5 is (1, 9)-colorable. Discret. Math. 345(6): 112818 (2022) - [j7]Jian-Bo Lv:
Planar Graphs Without Cycles of Length from 4 to 7 and Intersecting Triangles are DP-3-Colorable. Graphs Comb. 38(1): 8 (2022) - [j6]Jian-Bo Lv, Jianxi Li, Xiaoxia Zhang:
On Strong Edge-Coloring of Claw-Free Subcubic Graphs. Graphs Comb. 38(3): 63 (2022) - 2021
- [j5]Jian-Bo Lv, Jianxi Li, Nian Hong Zhou:
List injective edge-coloring of subcubic graphs. Discret. Appl. Math. 302: 163-170 (2021) - 2020
- [j4]Jian-Bo Lv, Jianxi Li:
The harmonic index of a graph and its DP-chromatic number. Discret. Appl. Math. 284: 611-615 (2020)
2010 – 2019
- 2018
- [j3]Jian-Bo Lv:
On the harmonic index of quasi-tree graphs. Ars Comb. 137: 305-315 (2018) - [j2]Jian-Bo Lv, Xiangwen Li, Gexin Yu:
On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235: 142-153 (2018) - 2014
- [j1]Jian-Bo Lv, Jianxi Li:
On the harmonic index and the matching number of a tree. Ars Comb. 116: 407-416 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-04 20:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
