default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiangxu Kong
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Yang Wang, Jiali Wang, Weifan Wang, Jiangxu Kong:
Partitioning planar graphs into bounded degree forests. Appl. Math. Comput. 474: 128705 (2024)- [j15]Juan Liu, Xiaoxue Hu
, Jiangxu Kong:
An improved upper bound on the edge-face coloring of 2-connected plane graphs. Discret. Math. 347(12): 114173 (2024) - 2023
- [j14]Jiangxu Kong, Yiqiao Wang, Jiacheng Hu, Yang Wang, Weifan Wang:
Plane graphs of diameter two are 2-optimal. Appl. Math. Comput. 441: 127717 (2023) - [j13]Yiqiao Wang, Jingjing Huo, Jiangxu Kong, Qiuyue Tan:
Coloring the square of maximal planar graphs with diameter two. Appl. Math. Comput. 459: 128263 (2023) - [j12]Juan Liu, Xiaoxue Hu, Dongdong Zhang, Jiangxu Kong:
The linear 2-arboricity of IC-planar graphs. Discret. Appl. Math. 338: 1-7 (2023) - 2022
- [j11]Xiaoxue Hu, Jiacheng Hu, Jiangxu Kong:
The Surviving Rate of IC-Planar Graphs. Symmetry 14(6): 1258 (2022) - 2020
- [j10]Jiangxu Kong, Xiaoxue Hu, Yiqiao Wang:
Plane graphs with Δ =7 are entirely 10-colorable. J. Comb. Optim. 40(1): 1-20 (2020)
2010 – 2019
- 2018
- [j9]Jiangxu Kong, Suohai Fan, Hong-Jian Lai, Murong Xu:
Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees. Ars Comb. 140: 149-172 (2018) - [j8]Hongping Ma, Xiaoxue Hu, Jiangxu Kong, Murong Xu:
Linear list r-hued coloring of sparse graphs. Discret. Math. Algorithms Appl. 10(4): 1850045:1-1850045:12 (2018) - 2017
- [j7]Jiangxu Kong, Lianzhu Zhang:
A note on the surviving rate of 1-planar graphs. Discret. Math. 340(5): 1074-1079 (2017) - 2016
- [j6]Tingting Wu, Jiangxu Kong, Wei-Fan Wang:
The 2-surviving rate of planar graphs without 5-cycles. J. Comb. Optim. 31(4): 1479-1492 (2016) - 2014
- [j5]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
The surviving rate of digraphs. Discret. Math. 334: 13-19 (2014) - [j4]Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
Structural properties and surviving rate of planar graphs. Discret. Math. Algorithms Appl. 6(4) (2014) - [j3]Weifan Wang, Stephen Finbow, Jiangxu Kong:
The 2-surviving rate of planar graphs without 6-cycles. Theor. Comput. Sci. 518: 22-31 (2014) - 2012
- [j2]Jiangxu Kong, Weifan Wang, Xuding Zhu:
The surviving rate of planar graphs. Theor. Comput. Sci. 416: 65-70 (2012) - [j1]Weifan Wang, Jiangxu Kong, Lianzhu Zhang:
The 2-surviving rate of planar graphs without 4-cycles. Theor. Comput. Sci. 457: 158-165 (2012)
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-08-23 18:36 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:
