Xiangwen Li

Orcid: 0000-0001-9328-0766

According to our database1, Xiangwen Li authored at least 77 papers between 2001 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


A Real-Time Monitoring Method for Droplet Transfer Frequency in Wire-Filled GTAW Based on Arc Sensing.
Sensors, March, 2024

On the Alon-Tarsi number of semi-strong product of graphs.
J. Comb. Optim., January, 2024

Limited-Label Multiscale Deep-Learning Multihorizon Tracking.
IEEE Trans. Geosci. Remote. Sens., 2024

Seismic Facies-Guided Trace-by-Trace High-Precision Strong and Weak Reflection Separation.
IEEE Trans. Geosci. Remote. Sens., 2024

Strata Boundary-Constrained Multitask Multihorizon Tracking.
IEEE Geosci. Remote. Sens. Lett., 2024

Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions.
Discret. Math., 2024

A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4<sup>-</sup>-Cycles.
Graphs Comb., December, 2023

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

Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable.
Australas. J Comb., October, 2023

CTF-Net: A Convolutional and Transformer Fusion Network for SAR Ship Detection.
IEEE Geosci. Remote. Sens. Lett., 2023

Two-Stage Multitask U-Network VSP Wavefield Separation.
IEEE Geosci. Remote. Sens. Lett., 2023

Strong edge-colorings of sparse graphs with 3Δ - 1 colors.
Inf. Process. Lett., 2023

Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs.
Appl. Math. Comput., 2023

A Min-Pooling Detection Method for Ship Targets in Noisy SAR Images.
IEEE Access, 2023

Attention-Based Two-Stage U-Net Horizon Tracking.
IEEE Geosci. Remote. Sens. Lett., 2022

Heterogeneous reservoir prediction of ultra-deep strike-slip fault-damaged zone constrained with local seismic anomaly data.
Earth Sci. Informatics, 2022

DP-4-colorability of planar graphs without intersecting 5-cycles.
Discret. Math., 2022

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

Online Extraction of Pose Information of 3D Zigzag-Line Welding Seams for Welding Seam Tracking.
Sensors, 2021

Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable.
Discret. Appl. Math., 2021

Welding Seam Trajectory Recognition for Automated Skip Welding Guidance of a Spatially Intermittent Welding Seam Based on Laser Vision Sensor.
Sensors, 2020

Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable.
Discret. Math., 2020

DP-4-colorability of planar graphs without adjacent cycles of given length.
Discret. Appl. Math., 2020

Every planar graph without adjacent cycles of length at most 8 is 3-choosable.
Eur. J. Comb., 2019

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable.
Discret. Math., 2019

A relaxation of the strong Bordeaux Conjecture.
J. Graph Theory, 2018

Every signed planar graph without cycles of length from 4 to 8 is 3-colorable.
Discret. Math., 2018

On strong edge-coloring of graphs with maximum degree 4.
Discret. Appl. Math., 2018

Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable.
J. Comb. Optim., 2017

Z<sub>3</sub>-Connectivity of Claw-Free Graphs.
Graphs Comb., 2017

Z<sub>3</sub>-Connectivity with Independent Number 2.
Graphs Comb., 2016

Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable.
Discret. Math., 2016

Nowhere-zero 3-flows and Z<sub>3</sub>-connectivity of graphs without two forbidden subgraphs.
Discret. Math., 2016

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms.
Ars Math. Contemp., 2016

Z_3-connectivity of K_{1, 3}-free graphs without induced cycle of length at least 5.
Ars Math. Contemp., 2016

Z<sub>3</sub>-Connectivity of Wreath Product of Graphs.
Graphs Comb., 2015

Group connectivity in J<sub>3</sub> line graphs.
Graphs Comb., 2015

Group Chromatic Number of Halin Graphs.
Graphs Comb., 2015

Group Connectivity and Matchings.
Graphs Comb., 2015

A relaxation of the Bordeaux Conjecture.
Eur. J. Comb., 2015

Nowhere-zero 3-flows in semistrong product of graphs.
Discret. Math., 2015

Collapsible graphs and Hamilton cycles of line graphs.
Discret. Appl. Math., 2015

Maximum degree of 3-independent vertices and group connectivity.
Ars Comb., 2015

Maximum Degree Condition and Group Connectivity.
Graphs Comb., 2014

The Chvátal-Erdös Condition for Group Connectivity in Graphs.
Graphs Comb., 2014

Realizing degree sequences as Z<sub>3</sub>-connected graphs.
Discret. Math., 2014

Nowhere-zero 3-flows of claw-free graphs.
Discret. Math., 2014

A Note on Z<sub>5</sub>-connectivity in 3-edge-connected graphs.
Ars Comb., 2014

The L(2, 1)-labelling problem for cubic Cayley graphs on dihedral groups.
J. Comb. Optim., 2013

Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs.
Graphs Comb., 2013

Group Connectivity of Bridged Graphs.
Graphs Comb., 2013

Neighborhood Unions and Z 3-Connectivity in Graphs.
Graphs Comb., 2013

Degree sum of 3 independent vertices and <i>Z</i><sub>3</sub>Z3-connectivity.
Discret. Math., 2013

Labeling outerplanar graphs with maximum degree three.
Discret. Appl. Math., 2013

Group connectivity of semistrong product of graphs.
Australas. J Comb., 2013

Group Connectivity in 3-Edge-Connected Graphs.
Graphs Comb., 2012

Degree condition and Z<sub>3</sub>-connectivity.
Discret. Math., 2012

Nowhere-zero 3-flows and Z<sub>3</sub>-connectivity in bipartite graphs.
Discret. Math., 2012

Nowhere-zero 3-flows in dihedral Cayley graphs.
Inf. Process. Lett., 2011

Small cycle covers of 3-connected cubic graphs.
Discret. Math., 2011

A Note on Spanning Eulerian Graphs.
Ars Comb., 2011

Interval coloring of (3, 4)-biregular bigraphs having two (2, 3)-biregular bipartite subgraphs.
Appl. Math. Lett., 2011

Degree sum condition for Z<sub>3</sub>-connectivity in graphs.
Discret. Math., 2010

Degree conditions for group connectivity.
Discret. Math., 2010

Optimal radio labellings of complete m-ary trees.
Discret. Appl. Math., 2010

A constructive characterization of total domination vertex critical graphs.
Discret. Math., 2009

On 3-choosable planar graphs of girth at least 4.
Discret. Math., 2009

An inequality for the group chromatic number of a graph.
Discret. Math., 2007

Group chromatic number of planar graphs of girth at least 4.
J. Graph Theory, 2006

Nowhere zero 4-flow in regular matroids.
J. Graph Theory, 2005

Spanning Trails Connecting Given Edges.
Graphs Comb., 2005

On Group Chromatic Number of Graphs.
Graphs Comb., 2005

Independent Cycles in a Bipartite Graph.
Ars Comb., 2004

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.
J. Graph Theory, 2003

Small cycle cover of 2-connected cubic graphs.
Discret. Math., 2003

Hamilton cycles in 1-tough triangle-free graphs.
Discret. Math., 2002

A degree condition of 2-factors in bipartite graphs.
Discret. Appl. Math., 2001