default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurong Xu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j11]Huixin Yin, Miaomiao Han, Murong Xu
:
Strong Edge Coloring of K4(t)-Minor Free Graphs. Axioms 12(6): 556 (2023)- [j10]Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu:
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. Discuss. Math. Graph Theory 43(1): 179-194 (2023) - [c1]Anne-Marie Rickmann, Murong Xu, Tom Nuno Wolf, Oksana P. Kovalenko, Christian Wachinger:
HALOS: Hallucination-Free Organ Segmentation After Organ Resection Surgery. IPMI 2023: 667-678 - [i1]Anne-Marie Rickmann, Murong Xu, Tom Nuno Wolf, Oksana P. Kovalenko, Christian Wachinger:
HALOS: Hallucination-free Organ Segmentation after Organ Resection Surgery. CoRR abs/2303.07717 (2023) - 2022
- [j9]Ye Chen, Suohai Fan, Hong-Jian Lai, Murong Xu:
Graph r-hued colorings - A survey. Discret. Appl. Math. 321: 24-48 (2022) - [j8]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu:
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38(3): 72 (2022) - 2020
- [j7]Ye Chen, Suohai Fan, Hong-Jian Lai, Huimin Song, Murong Xu:
Decomposition and r-hued Coloring of K4(7)-minor free graphs. Appl. Math. Comput. 384: 125206 (2020)
2010 – 2019
- 2019
- [j6]Hong-Jian Lai, Xuezheng Lv, Murong Xu:
On r-hued colorings of graphs without short induced paths. Discret. Math. 342(7): 1904-1911 (2019) - 2018
- [j5]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) - [j4]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) - [j3]Janet Anderson, Hong-Jian Lai, Xiaomin Li, Xiaoxia Lin, Murong Xu:
Minimax properties of some density measures in graphs and digraphs. Int. J. Comput. Math. Comput. Syst. Theory 3(1): 1-12 (2018) - 2017
- [j2]Janet Anderson, Hong-Jian Lai, Xiaoxia Lin, Murong Xu:
On k-Maximal Strength Digraphs. J. Graph Theory 84(1): 17-25 (2017) - 2016
- [j1]Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu:
On the lower bound of k-maximal digraphs. Discret. Math. 339(10): 2500-2510 (2016)
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-05 21:15 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:
