Hong-Jian Lai

,

Austin Luo

Discret. Math. Algorithms Appl., October, 2025

Supereulerian Oriented Graphs With Large Arc-Strong Connectivity.

[BibT_eX]

[DOI]

Jia Wei

,

J. Graph Theory, 2025

The r-hued coloring of K4(7)-minor free graphs.

[BibT_eX]

[DOI]

Jiani Zou

,

,

Discret. Appl. Math., 2025

Ramsey and Gallai-Ramsey numbers for comb and sun graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

Two problems on Laplacian ratios of trees.

[BibT_eX]

[DOI]

Tingzeng Wu

,

Xiangshuai Dong

,

Discret. Appl. Math., 2025

Supereulerian of regular matroids with cogirth conditions.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

The list r-hued coloring of Halin graph.

[BibT_eX]

[DOI]

Shudan Lu

,

,

Discret. Appl. Math., 2025

The matching-connectivity of a graph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Appl. Math., 2025

Symmetric cores and extremal size bound for supereulerian semicomplete bipartite digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., April, 2024

On s-hamiltonian-connected line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2024

Spanning trails avoiding and containing given edges.

[BibT_eX]

[DOI]

,

,

,

,

Discuss. Math. Graph Theory, 2024

Square coloring of planar graphs with maximum degree at most five.

[BibT_eX]

[DOI]

Jiani Zou

,

,

Discret. Appl. Math., 2024

Squares of graphs are optimally (s,t)-supereulerian.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2024

Spanning connectivity of K1,r-free split graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2024

The list r-hued coloring of Km,n.

[BibT_eX]

[DOI]

Meng Tang

,

,

Discret. Appl. Math., 2024

On r-hued coloring of connected P5-free tripartite graphs.

[BibT_eX]

[DOI]

Yaxin Shi

,

,

Appl. Math. Comput., 2024

Hamilton-connected claw-free graphs with Ore-degree conditions.

[BibT_eX]

[DOI]

Xia Liu

,

Discret. Appl. Math., December, 2023

Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., October, 2023

On the Linear Arboricity of Graphs with Treewidth at Most Four.

[BibT_eX]

[DOI]

Hong-Yu Chen

,

Graphs Comb., August, 2023

On hamiltonian properties of K1,r-free split graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., July, 2023

Gallai-Ramsey Numbers Involving a Rainbow 4-Path.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., June, 2023

Supereulerian regular matroids without small cocircuits.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Graph Theory, 2023

On the sizes of (k, l)-edge-maximal r-uniform hypergraphs.

[BibT_eX]

[DOI]

,

,

,

Discuss. Math. Graph Theory, 2023

Complete family reduction and spanning connectivity in line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2023

On list r-hued coloring of outer-1-planar graphs.

[BibT_eX]

[DOI]

Lingmei Liang

,

,

Appl. Math. Comput., 2023

Trail-Connected Digraphs with Given Local Structures.

[BibT_eX]

[DOI]

,

,

,

J. Interconnect. Networks, 2022

On hamiltonian line graphs of hypergraphs.

[BibT_eX]

[DOI]

,

,

Sulin Song

J. Graph Theory, 2022

The Extremal Sizes of Arc-Maximal (k, l)-Digraphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2022

Asymptotically sharpening the $s$-Hamiltonian index bound.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Theor. Comput. Sci., 2022

On the s-hamiltonianicity of an hourglass-free line graph.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2022

Hamiltonian line graphs with local degree conditions.

[BibT_eX]

[DOI]

Xia Liu

,

Sulin Song

,

Discret. Math., 2022

Hamiltonian s-properties and eigenvalues of k-connected graphs.

[BibT_eX]

[DOI]

Ruifang Liu

,

,

Rao Li

Discret. Math., 2022

Modulo orientations and matchings in graphs.

[BibT_eX]

[DOI]

Jianbing Liu

,

,

Discret. Math., 2022

On the extended Clark-Wormold Hamiltonian-like index problem.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2022

On r-hued list coloring of K4(7)-minor free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2022

Bounding ℓ-edge-connectivity in edge-connectivity.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2022

Strengthened Ore conditions for (s, t)-supereulerian graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2022

Graph r-hued colorings - A survey.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2022

Weighted Modulo Orientations of Graphs and Signed Graphs.

[BibT_eX]

[DOI]

Jianbing Liu

,

,

Electron. J. Comb., 2022

Local Optimality of Mixed Reliability for Several Classes of Networks with Fixed Sizes.

[BibT_eX]

[DOI]

Lixin Dong

,

Haixing Zhao

,

Axioms, 2022

Hamiltonian index of directed multigraph.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2022

A Note on Group Colorings and Group Structure.

[BibT_eX]

[DOI]

,

Lucian Mazza

SIAM J. Discret. Math., 2021

Induced subgraphs of product graphs and a generalization of Huang's theorem.

[BibT_eX]

[DOI]

Zhen-Mu Hong

,

,

Jianbing Liu

J. Graph Theory, 2021

Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs.

[BibT_eX]

[DOI]

Xia Liu

,

Liming Xiong

,

Graphs Comb., 2021

Group Colorings and DP-Colorings of Multigraphs Using Edge-Disjoint Decompositions.

[BibT_eX]

[DOI]

,

Lucian Mazza

Graphs Comb., 2021

Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree.

[BibT_eX]

[DOI]

Mansour J. Algefari

,

Graphs Comb., 2021

Polynomially determine if a graph is (s, 3)-supereulerian.

[BibT_eX]

[DOI]

Wei Xiong

,

Sulin Song

,

Discret. Math., 2021

On s-hamiltonicity of net-free line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2021

On the line graph of a graph with diameter 2.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2021

On (s, t)-supereulerian graphs with linear degree bounds.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2021

Symmetric core and spanning trails in directed networks.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2021

Edge-disjoint spanning trees and forests of graphs.

[BibT_eX]

[DOI]

Jiang Zhou

,

Changjiang Bu

,

Discret. Appl. Math., 2021

Polynomially determining spanning connectivity of locally connected line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2021

Matching and spanning trails in digraphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2021

Two-disjoint-cycle-cover vertex bipancyclicity of the bipartite generalized hypercube.

[BibT_eX]

[DOI]

Ruichao Niu

,

Min Xu

,

Appl. Math. Comput., 2021

On the sizes of bi-k-maximal graphs.

[BibT_eX]

[DOI]

Liqiong Xu

,

Yingzhi Tian

,

J. Comb. Optim., 2020

A characterization of graphs with supereulerian line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Comput. Math. Comput. Syst. Theory, 2020

Unified Spectral Hamiltonian Results of Balanced Bipartite Graphs and Complementary Graphs.

[BibT_eX]

[DOI]

Muhuo Liu

,

Yang Wu

,

Graphs Comb., 2020

On weighted modulo orientation of graphs.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2020

Contractible graphs for flow index less than three.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2020

On the extremal sizes of maximal graphs without (k+1)-connected subgraphs.

[BibT_eX]

[DOI]

Liqiong Xu

,

,

Yingzhi Tian

Discret. Appl. Math., 2020

Decomposition and r-hued Coloring of K4(7)-minor free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Appl. Math. Comput., 2020

Catlin's reduced graphs with small orders.

[BibT_eX]

[DOI]

,

,

,

AKCE Int. J. Graphs Comb., 2020

Pancyclicity of 4-connected claw-free net-free graphs.

[BibT_eX]

[DOI]

,

,

,

Australas. J Comb., 2020

Characterizations of matroids with an element lying in a restricted number of circuits.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2019

On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Yingzhi Tian

,

,

Jixiang Meng

Graphs Comb., 2019

Pancyclicity of 4-Connected { K1, 3, Z8} -Free Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2019

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2019

Spectral results on Hamiltonian problem.

[BibT_eX]

[DOI]

Muhuo Liu

,

,

Kinkar Chandra Das

Discret. Math., 2019

On s-hamiltonian line graphs of claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2019

On r-hued colorings of graphs without short induced paths.

[BibT_eX]

[DOI]

,

Xuezheng Lv

,

Murong Xu

Discret. Math., 2019

Packing spanning trees in highly essentially connected graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2019

Modulo 5-orientations and degree sequences.

[BibT_eX]

[DOI]

,

,

Jianping Liu

Discret. Appl. Math., 2019

Collapsible subgraphs of a 4-edge-connected graph.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2019

Spectral analogues of Erdős' theorem on Hamilton-connected graphs.

[BibT_eX]

[DOI]

Jia Wei

,

Zhifu You

,

Appl. Math. Comput., 2019

Vertex-connectivity and eigenvalues of graphs with fixed girth.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2019

An O(log2(N)) Algorithm for Reliability Evaluation of h-Extra Edge-Connectivity of Folded Hypercubes.

[BibT_eX]

[DOI]

,

,

,

IEEE Trans. Reliab., 2018

Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2018

Supereulerian bipartite digraphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2018

Nowhere-zero 3-flow and -connectedness in graphs with four edge-disjoint spanning trees.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2018

The connectivity of generalized graph products.

[BibT_eX]

[DOI]

,

Lan Lei

,

Inf. Process. Lett., 2018

Sensitivity of r-hued colouring of graphs.

[BibT_eX]

[DOI]

,

,

,

Int. J. Comput. Math. Comput. Syst. Theory, 2018

Minimax properties of some density measures in graphs and digraphs.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Comput. Math. Comput. Syst. Theory, 2018

Constructing Graphs Which are Permanental Cospectral and Adjacency Cospectral.

[BibT_eX]

[DOI]

Tingzeng Wu

,

Graphs Comb., 2018

Connectivity keeping stars or double-stars in 2-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

List r-hued chromatic number of graphs with bounded maximum average degrees.

[BibT_eX]

[DOI]

Huimin Song

,

,

Jianliang Wu

Discret. Math., 2018

Degree sum and hamiltonian-connected line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2018

Upper bounds of r-hued colorings of planar graphs.

[BibT_eX]

[DOI]

Huimin Song

,

Discret. Appl. Math., 2018

Modulo orientations with bounded independence number.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2018

r-hued coloring of sparse graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Appl. Math., 2018

Locally dense supereulerian digraphs.

[BibT_eX]

[DOI]

Mansour J. Algefari

,

,

Jinquan Xu

Discret. Appl. Math., 2018

Strongly Spanning Trailable Graphs with Short Longest Paths.

[BibT_eX]

,

,

,

Ars Comb., 2018

Linear list r-hued colorings of graphs with bounded maximum subgraph average degrees.

[BibT_eX]

,

,

,

Ars Comb., 2018

On the permanental sum of graphs.

[BibT_eX]

[DOI]

Tingzeng Wu

,

Appl. Math. Comput., 2018

Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees.

[BibT_eX]

[DOI]

,

,

Rong Luo

SIAM J. Discret. Math., 2017

Characterization of Digraphic Sequences with Strongly Connected Realizations.

[BibT_eX]

[DOI]

,

Qinghai Liu

,

J. Graph Theory, 2017

On k-Maximal Strength Digraphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2017

Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

Liming Xiong

J. Comb. Theory B, 2017

Characterizations of k-cutwidth critical trees.

[BibT_eX]

[DOI]

Zhen-Kun Zhang

,

J. Comb. Optim., 2017

Supereulerian width of dense graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2017

Panconnected index of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2017

Spanning trails with variations of Chvátal-Erdős conditions.

[BibT_eX]

[DOI]

,

,

Meng Zhang

Discret. Math., 2017

3-dynamic coloring and list 3-dynamic coloring of K1, 3-free graphs.

[BibT_eX]

[DOI]

Hao Li

,

Discret. Appl. Math., 2017

Algorithm for constraint partial inverse matroid problem with weight increase forbidden.

[BibT_eX]

[DOI]

Shuangshuang Li

,

Zhao Zhang

,

Theor. Comput. Sci., 2016

On Perfect Matching Coverings and Even Subgraph Coverings.

[BibT_eX]

[DOI]

Xinmin Hou

,

,

J. Graph Theory, 2016

Edge-Disjoint Spanning Trees, Edge Connectivity, and Eigenvalues in Graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2016

Supereulerian Digraphs with Large Arc-Strong Connectivity.

[BibT_eX]

[DOI]

Mansour J. Algefari

,

J. Graph Theory, 2016

Algorithms for the partial inverse matroid problem in which weights can only be increased.

[BibT_eX]

[DOI]

,

,

,

J. Glob. Optim., 2016

Supereulerian digraphs with given local structures.

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2016

Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2016

On dense strongly Z2s-1-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

Element deletion changes in dynamic coloring of graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

On the lower bound of k-maximal digraphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2016

Ore-type degree condition of supereulerian digraphs.

[BibT_eX]

[DOI]

,

Qinghai Liu

,

Discret. Math., 2016

On r-hued coloring of planar graphs with girth at least 6.

[BibT_eX]

[DOI]

Huimin Song

,

,

Jian-Liang Wu

Discret. Appl. Math., 2016

Supereulerian graphs with small circumference and 3-connected hamiltonian claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2016

Supereulerian graphs with width s and s-collapsible graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2016

Fractional spanning tree packing, forest covering and eigenvalues.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2016

On group choosability of graphs, I.

[BibT_eX]

,

,

,

Ars Comb., 2016

Graphs with a 3-Cycle-2-Cover.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2015

Degree sequence realizations with given packing and covering of spanning trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2015

K-5-factor in a Graph.

[BibT_eX]

,

,

Ars Comb., 2015

On Mod (2s+1)-Orientations of Graphs.

[BibT_eX]

[DOI]

Ping Li

,

SIAM J. Discret. Math., 2014

Spanning 3-connected index of graphs.

[BibT_eX]

[DOI]

Wei Xiong

,

Zhao Zhang

,

J. Comb. Optim., 2014

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Comput. Math., 2014

Collapsible Graphs and Hamiltonicity of Line Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2014

Characterizations of Strength Extremal Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2014

On Group Choosability of Graphs, II.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2014

Realizing degree sequences as Z3-connected graphs.

[BibT_eX]

[DOI]

Fan Yang

,

,

Discret. Math., 2014

On the existence of super edge-connected graphs with prescribed degrees.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2014

On r-hued coloring of K4-minor free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2014

On extremal k-supereulerian graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2014

Supereulerian digraphs.

[BibT_eX]

[DOI]

,

,

Qinghai Liu

Discret. Math., 2014

Spanning trails in essentially 4-edge-connected graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2014

On strongly Z2s-1-connected graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Discret. Appl. Math., 2014

Bounds of eigenvalues of a nontrivial bipartite graph.

[BibT_eX]

,

Bolian Liu

,

Ju Zhou

Ars Comb., 2014

Analytical Solution of Steady-State Equations for Chemical Reaction Networks with Bilinear Rate Laws.

[BibT_eX]

[DOI]

Ádám M. Halász

,

,

Meghan McCabe Pryor

,

Krishnan Radhakrishnan

,

Jeremy S. Edwards

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

On s-Hamiltonian Line Graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2013

On Group Choosability of Total Graphs.

[BibT_eX]

[DOI]

,

G. R. Omidi

,

Ghaffar Raeisi

Graphs Comb., 2013

On Spanning Disjoint Paths in Line Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2013

Hamilton cycles in 3-connected claw-free and net-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2013

Group colorability of multigraphs.

[BibT_eX]

[DOI]

Hao Li

,

Discret. Math., 2013

Non-separating subgraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Realizing degree sequences with k-edge-connected uniform hypergraphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2013

Group connectivity of complementary graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2012

The Connectivity and Diameter of Second Order Circuit Graphs of Matroids.

[BibT_eX]

[DOI]

Jinquan Xu

,

Ping Li

,

Graphs Comb., 2012

Spanning cycles in regular matroids without small cocircuits.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2012

Z3-connectivity of 4-edge-connected 2-triangular graphs.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2012

Spanning subgraph with Eulerian components.

[BibT_eX]

[DOI]

Zhaohong Niu

,

,

Liming Xiong

Discret. Math., 2012

Degree condition and Z3-connectivity.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

A dual version of the Brooks group coloring theorem.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2012

On 3-connected hamiltonian line graphs.

[BibT_eX]

[DOI]

Ye Chen

,

Suohai Fan

,

Discret. Math., 2012

Collapsible graphs and Hamiltonian connectedness of line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2012

Characterization of removable elements with respect to having k disjoint bases in a matroid.

[BibT_eX]

[DOI]

Ping Li

,

,

Discret. Appl. Math., 2012

On dynamic coloring for planar graphs and graphs of higher genus.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2012

Hamiltonian graphs involving neighborhood conditions.

[BibT_eX]

,

,

,

Ars Comb., 2012

Spanning Eulerian Subgraphs in Generalized Prisms.

[BibT_eX]

,

,

Ars Comb., 2012

Hamiltonicity of 3-connected line graphs.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2012

Multigraphic degree sequences and supereulerian graphs, disjoint spanning trees.

[BibT_eX]

[DOI]

,

,

Appl. Math. Lett., 2012

Mod (2p+1)-orientations in line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Inf. Process. Lett., 2011

Characterization of minimally (2, l)-connected graphs.

[BibT_eX]

[DOI]

,

,

Senmei Yao

Inf. Process. Lett., 2011

On 3-Edge-Connected Supereulerian Graphs.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2011

Obstructions to a binary matroid being graphic.

[BibT_eX]

[DOI]

,

,

,

,

Eur. J. Comb., 2011

Every N2-Locally Connected claw-Free Graph with Minimum Degree at Least 7 is Z3-Connected.

[BibT_eX]

[DOI]

,

,

,

Discret. Math. Algorithms Appl., 2011

Group connectivity in line graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2011

Degree sequences and graphs with disjoint spanning trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2011

Supereulerian graphs in the graph family C2(6, k).

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2011

Supereulerian graphs and matchings.

[BibT_eX]

[DOI]

,

Huiya Yan

Appl. Math. Lett., 2011

Every 3-connected claw-free Z8-free graph is Hamiltonian.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2010

Degree sum condition for Z3-connectivity in graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2010

Degree conditions for group connectivity.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2010

On 3-edge-connected supereulerian graphs in graph family C(l, k).

[BibT_eX]

[DOI]

,

,

Discret. Math., 2010

On (s, t)-supereulerian graphs in locally highly connected graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2010

The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2010

Balanced and 1-balanced graph constructions.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Appl. Math., 2010

Spanning eulerian subgraphs in N2-locally connected claw-free graphs.

[BibT_eX]

,

,

,

Ars Comb., 2010

On mod (2p+1)-orientations of graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2009

Every line graph of a 4-edge-connected graph is I-connected.

[BibT_eX]

[DOI]

,

Lianying Miao

,

Eur. J. Comb., 2009

The supereulerian graphs in the graph family C(l, k).

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

Hamilton-connected indices of graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2009

Edge-connectivity and edge-disjoint spanning trees.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2009

Hamiltonian connectedness in 3-connected line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2009

Transforming a graph into a 1-balanced graph.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2009

Reinforcing the number of disjoint spanning trees.

[BibT_eX]

Damin Liu

,

,

Ars Comb., 2009

Random walks for selected boolean implication and equivalence problems.

[BibT_eX]

[DOI]

K. Subramani

,

,

Acta Informatica, 2009

Nowhere-zero 3-flows in triangularly connected graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory B, 2008

On Group Connectivity of Graphs.

[BibT_eX]

[DOI]

,

Rui Xu

,

Ju Zhou

Graphs Comb., 2008

Spanning cycles in regular matroids without M*(K5) minors.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2008

The s-Hamiltonian index.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Hamiltonian connected hourglass free line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2008

Every 4-connected line graph of a quasi claw-free graph is hamiltonian connected.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2008

On s-hamiltonian-connected line graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2008

Degree sequence and supereulerian graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2008

Hamiltonian-connected graphs.

[BibT_eX]

[DOI]

Kewen Zhao

,

,

Ju Zhou

Comput. Math. Appl., 2008

New Sufficient Conditions for s-Hamiltonian Graphs and s-Hamiltonian Connected Graphs.

[BibT_eX]

,

,

,

Ars Comb., 2008

Group connectivity of certain graphs.

[BibT_eX]

Jingjing Chen

,

Elaine M. Eschen

,

Ars Comb., 2008

Mod (2p + 1)-Orientations and $K1,2p+1-Decompositions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

An s -Hamiltonian Line Graph Problem.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 2007

Quadrangularly connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2007

Erratum to "Collapsible biclaw-free graphs": [Discrete Math 306 (2006) 2115-2117].

[BibT_eX]

[DOI]

,

Discret. Math., 2007

An inequality for the group chromatic number of a graph.

[BibT_eX]

[DOI]

,

,

Gexin Yu

Discret. Math., 2007

On Circular Flows Of Graphs.

[BibT_eX]

[DOI]

,

Rui Xu

,

Comb., 2007

New sufficient condition for Hamiltonian graphs.

[BibT_eX]

[DOI]

Kewen Zhao

,

,

Appl. Math. Lett., 2007

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

[BibT_eX]

[DOI]

,

J. Graph Theory, 2006

Hamiltonicity in 3-connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2006

Every 3-connected, essentially 11-connected line graph is Hamiltonian.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2006

Group connectivity of graphs with diameter at most 2.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2006

Collapsible biclaw-free graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2006

Conditional colorings of graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2006

Hamiltonian N2-locally connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2005

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

Eulerian subgraphs and Hamilton-connected line graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2005

Supereulerian planar graphs.

[BibT_eX]

,

,

,

Ars Comb., 2005

Generalized honeycomb torus is Hamiltonian.

[BibT_eX]

[DOI]

,

,

,

Inf. Process. Lett., 2004

On the maximal connected component of hypercube with faulty vertices.

[BibT_eX]

[DOI]

,

,

,

,

Int. J. Comput. Math., 2004

Global asymptotic stability in a rational recursive sequence.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Comput., 2004

Nowhere-zero 3-flows in locally connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Minimally (k, k)-edge-connected graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2003

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

Upper Bounds of Dynamic Chromatic Number.

[BibT_eX]

,

Bruce Montgomery

,

Hoifung Poon

Ars Comb., 2003

Group Chromatic Number of Graphs without K5-Minors.

[BibT_eX]

[DOI]

,

Xiankun Zhang

Graphs Comb., 2002

Cycle Cover Ratio of Regular Matroids.

[BibT_eX]

[DOI]

,

Hoifung Poon

Eur. J. Comb., 2002

Group Colorability of Graphs.

[BibT_eX]

,

Xiankun Zhang

Ars Comb., 2002

Hamilton weights and Petersen minors.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2001

Line Graphs and Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

,

Lubomír Soltés

J. Comb. Theory B, 2001

Eulerian subgraphs containing given edges.

[BibT_eX]

[DOI]

Discret. Math., 2001

Paul Catlin 1948-1995.

[BibT_eX]

[DOI]

Arthur M. Hobbs

,

,

Neil Robertson

Discret. Math., 2001

Dedication.

[BibT_eX]

[DOI]

Arthur M. Hobbs

,

Discret. Math., 2001

Nowhere zero flows in line graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2001

Graph family operations.

[BibT_eX]

[DOI]

,

Arthur M. Hobbs

,

Discret. Math., 2001

Group Connectivity of 3-Edge-Connected Chordal Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2000

Spanning trails that join given edges in 3-edge-connected graphs.

[BibT_eX]

,

Xiankun Zhang

Ars Comb., 2000

Extending a partial nowhere-zero 4-flow.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Connectivity of cycle matroids and bicircular matroids.

[BibT_eX]

,

Kuang Ying-Qiang

,

Ars Comb., 1999

Eulerian subgraphs containing given vertices and hamiltonian line graphs.

[BibT_eX]

[DOI]

Discret. Math., 1998

Supereulerian graphs and the Petersen Graph, II.

[BibT_eX]

,

Ars Comb., 1998

Supereulerian Graphs and the Petersen Graph.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1996

A Property on Edge-disjoint Spanning Trees.

[BibT_eX]

[DOI]

,

,

Charles Payan

Eur. J. Comb., 1996

Graphs without spanning closed trails.

[BibT_eX]

[DOI]

,

Zheng-Yiao Han

,

Discret. Math., 1996

The size of graphs without nowhere-zero 4-flows.

[BibT_eX]

[DOI]

J. Graph Theory, 1995

Strength and fractional arboricity of complementary graphs.

[BibT_eX]

[DOI]

,

Guoqing Weng

Discret. Math., 1995

Supereulerian graphs and excluded induced minors.

[BibT_eX]

[DOI]

Discret. Math., 1995

Vertex arboricity and maximum degree.

[BibT_eX]

[DOI]

,

Discret. Math., 1995

Every Matroid Is a Submatroid of a Uniformly Dense Matroid.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 1995

Large Survivable Nets and the Generalized Prisms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

The size of graphs with given edge inclusive connectivity.

[BibT_eX]

,

Ars Comb., 1995

Edge-maximal (k, i)-graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1994

Small Circuit Double Covers of Cubic Multigraphs.

[BibT_eX]

[DOI]

,

Xingxing Yu

,

J. Comb. Theory B, 1994

Every 4-Connected Line Graph of a Planar Graph is Hamiltonian.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Supereulerian complementary graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

Collapsible graphs and matchings.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1993

Nowhere-zero 3-flows of highly connected graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1992

Duality in graph families.

[BibT_eX]

[DOI]

,

Discret. Math., 1992

Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 1992

Graph whose edges are in small cycles.

[BibT_eX]

[DOI]

Discret. Math., 1991

The size of strength-maximal graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Reduced graphs of diameter two.

[BibT_eX]

[DOI]

J. Graph Theory, 1990

Unique graph homomorphisms onto odd cycles, II.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1989

Contractions and hamiltonian line graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1988

On the Hamiltonian index.

[BibT_eX]

[DOI]