Xiangwen Li

J. Comb. Optim., January, 2024

Limited-Label Multiscale Deep-Learning Multihorizon Tracking.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

,

,

IEEE Trans. Geosci. Remote. Sens., 2024

Seismic Facies-Guided Trace-by-Trace High-Precision Strong and Weak Reflection Separation.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

,

,

IEEE Trans. Geosci. Remote. Sens., 2024

Strata Boundary-Constrained Multitask Multihorizon Tracking.

[BibT_eX]

[DOI]

,

,

,

,

,

,

IEEE Geosci. Remote. Sens. Lett., 2024

Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions.

[BibT_eX]

[DOI]

Lin Niu

,

Discret. Math., 2024

A (2, 1)-Decomposition of Planar Graphs Without Intersecting 3-Cycles and Adjacent 4--Cycles.

[BibT_eX]

[DOI]

Fangyu Tian

,

Graphs Comb., December, 2023

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

[BibT_eX]

[DOI]

,

Jie Liu

,

Graphs Comb., December, 2023

Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable.

[BibT_eX]

[DOI]

,

Mao Zhang

Australas. J Comb., October, 2023

CTF-Net: A Convolutional and Transformer Fusion Network for SAR Ship Detection.

[BibT_eX]

[DOI]

,

,

,

,

,

IEEE Geosci. Remote. Sens. Lett., 2023

Two-Stage Multitask U-Network VSP Wavefield Separation.

[BibT_eX]

[DOI]

,

,

,

,

,

,

IEEE Geosci. Remote. Sens. Lett., 2023

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

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2023

Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs.

[BibT_eX]

[DOI]

Fangyu Tian

,

Lin Niu

,

Appl. Math. Comput., 2023

A Min-Pooling Detection Method for Ship Targets in Noisy SAR Images.

[BibT_eX]

[DOI]

,

,

,

,

,

,

IEEE Access, 2023

Attention-Based Two-Stage U-Net Horizon Tracking.

[BibT_eX]

[DOI]

,

,

,

,

,

,

IEEE Geosci. Remote. Sens. Lett., 2022

Heterogeneous reservoir prediction of ultra-deep strike-slip fault-damaged zone constrained with local seismic anomaly data.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

,

,

Earth Sci. Informatics, 2022

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

[BibT_eX]

[DOI]

,

,

Mao Zhang

Discret. Math., 2022

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

[BibT_eX]

[DOI]

,

Jie Liu

,

Discret. Math., 2022

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

[BibT_eX]

[DOI]

,

,

,

,

,

Sensors, 2021

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

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2021

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

[BibT_eX]

[DOI]

,

,

,

,

Sensors, 2020

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

[BibT_eX]

[DOI]

,

Yuxue Yin

,

Discret. Math., 2020

DP-4-colorability of planar graphs without adjacent cycles of given length.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2020

Every planar graph without adjacent cycles of length at most 8 is 3-choosable.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable.

[BibT_eX]

[DOI]

,

Discret. Math., 2019

A relaxation of the strong Bordeaux Conjecture.

[BibT_eX]

[DOI]

Ziwen Huang

,

,

J. Graph Theory, 2018

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

[BibT_eX]

[DOI]

Lili Hu

,

Discret. Math., 2018

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

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2018

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

[BibT_eX]

[DOI]

Ying Bai

,

,

J. Comb. Optim., 2017

Z3-Connectivity of Claw-Free Graphs.

[BibT_eX]

[DOI]

Ziwen Huang

,

,

Jianqing Ma

Graphs Comb., 2017

Z3-Connectivity with Independent Number 2.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2016

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

[BibT_eX]

[DOI]

,

,

Discret. Math., 2016

Nowhere-zero 3-flows and Z3-connectivity of graphs without two forbidden subgraphs.

[BibT_eX]

[DOI]

,

Yuanyuan Liu

Discret. Math., 2016

Nowhere-zero 3-flows in graphs admitting solvable arc-transitive groups of automorphisms.

[BibT_eX]

[DOI]

,

Ars Math. Contemp., 2016

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

[BibT_eX]

[DOI]

,

Jianqing Ma

Ars Math. Contemp., 2016

Z3-Connectivity of Wreath Product of Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

Group connectivity in J3 line graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

Group Chromatic Number of Halin Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Group Connectivity and Matchings.

[BibT_eX]

[DOI]

Mingfang Huang

,

Graphs Comb., 2015

A relaxation of the Bordeaux Conjecture.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2015

Nowhere-zero 3-flows in semistrong product of graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

Collapsible graphs and Hamilton cycles of line graphs.

[BibT_eX]

[DOI]

,

Yan Xiong

Discret. Appl. Math., 2015

Maximum degree of 3-independent vertices and group connectivity.

[BibT_eX]

Mingfang Huang

,

Ars Comb., 2015

Maximum Degree Condition and Group Connectivity.

[BibT_eX]

[DOI]

,

Graphs Comb., 2014

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

[BibT_eX]

[DOI]

,

Graphs Comb., 2014

Realizing degree sequences as Z3-connected graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2014

Nowhere-zero 3-flows of claw-free graphs.

[BibT_eX]

[DOI]

Jianqing Ma

,

Discret. Math., 2014

A Note on Z5-connectivity in 3-edge-connected graphs.

[BibT_eX]

Mingfang Huang

,

Ars Comb., 2014

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

[BibT_eX]

[DOI]

,

Vicky H. Mak-Hau

,

J. Comb. Optim., 2013

Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2013

Group Connectivity of Bridged Graphs.

[BibT_eX]

[DOI]

,

,

Chi Shu

Graphs Comb., 2013

Neighborhood Unions and Z 3-Connectivity in Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2013

Degree sum of 3 independent vertices and Z3Z3-connectivity.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Labeling outerplanar graphs with maximum degree three.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2013

Group connectivity of semistrong product of graphs.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2013

Group Connectivity in 3-Edge-Connected Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2012

Degree condition and Z3-connectivity.

[BibT_eX]

[DOI]

,

,

Yehong Shao

Discret. Math., 2012

Nowhere-zero 3-flows and Z3-connectivity in bipartite graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2012

Nowhere-zero 3-flows in dihedral Cayley graphs.

[BibT_eX]

[DOI]

,

Inf. Process. Lett., 2011

Small cycle covers of 3-connected cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2011

A Note on Spanning Eulerian Graphs.

[BibT_eX]

,

Ars Comb., 2011

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

[BibT_eX]

[DOI]

,

Appl. Math. Lett., 2011

Degree sum condition for Z3-connectivity in graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2010

Degree conditions for group connectivity.

[BibT_eX]

[DOI]

Xiangjuan Yao

,

,

Discret. Math., 2010

Optimal radio labellings of complete m-ary trees.

[BibT_eX]

[DOI]

,

Vicky H. Mak

,

Discret. Appl. Math., 2010

A constructive characterization of total domination vertex critical graphs.

[BibT_eX]

[DOI]

Chunxiang Wang

,

Zhiquan Hu

,

Discret. Math., 2009

On 3-choosable planar graphs of girth at least 4.

[BibT_eX]

[DOI]

Discret. Math., 2009

An inequality for the group chromatic number of a graph.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2007

Group chromatic number of planar graphs of girth at least 4.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2006

Nowhere zero 4-flow in regular matroids.

[BibT_eX]

[DOI]

,

,

Hoifung Poon

J. Graph Theory, 2005

Spanning Trails Connecting Given Edges.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2005

On Group Chromatic Number of Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2005

Independent Cycles in a Bipartite Graph.

[BibT_eX]

,

Bing Wei

,

Ars Comb., 2004

Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2003

Small cycle cover of 2-connected cubic graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Hamilton cycles in 1-tough triangle-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2002

A degree condition of 2-factors in bipartite graphs.

[BibT_eX]

[DOI]

,

Bing Wei

,