SelectedWorks - Zhi-Hong Chen

Contact

Selected Works of Zhi-Hong Chen

Professor of Computer Science

Dr. Chen is a professor in the Department of Computer Science and Software Engineering at Butler University.

Works
About

×

About Zhi-Hong Chen

Dr. Chen is a professor in the Department of Computer Science and Software Engineering at Butler University.

Present	Professor of Computer Science, Butler University ‐ Department of Computer Science & Software Engineering
Institution Organization Position Type Position Title Time Period to Options Current Position Affiliate my profile with this Institution

Cancel

Computer Sciences

Department ofComputer Science & Software Engineering
Butler University
4600 Sunset Avenue
Indianapolis, IN 46208-3485
(317) 940-6540

Email:

Articles (41)

Hamiltonicity of claw-free graphs and Fan-type conditions

Discrete Mathematics (2019)

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Degree and neighborhood conditions for hamiltonicity of claw-free graphs

Discrete Mathematics (2017)

For a graph H , let σ t ( H ) = min { Σ i = 1 t d ...

Circumferences of 3-connected claw-free graphs, II

Discrete Mathematics (2017)

For a graph H , the circumference of H , denoted by c ( H ) , is the length ...

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

Discrete Mathematics (2017)

Zhi-Hong Chen, Hong-Jian Lai and Meng Zhang

Let α(G), α′(G), κ(G) and κ′(G) denote the independence number, the matching number, connectivity and edge connectivity of a graph G, respectively. We determine the finite graph ...

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

Journal of Combinatorial Theory, Series B (2017)

Zhi-Hong Chen, Hong-Jian Lai and Liming Xiong

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Chvátal-Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs

Graphs and Combinatorics (2016)

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs

Graphs and Combinatorics (2016)

A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G)v∈V(G), the graph G−vG−v is Hamiltonian. A graph is supereulerian if it ...

Circumferences of 3-connected claw-free graphs

Discrete Mathematics (2016)

In Li et al. (2009), proved that a 3-connected claw-free graph of order n with minimum degree δ contains a cycle of length at least min{n,6δ−15}, ...

A Twelve Vertex Theorem for 3-Connected Claw-Free Graphs

Graphs and Combinatorics (2016)

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Spanning Eulerian subgraphs and Catlin’s reduced graphs

Journal of Combinatorial Mathematics and Combinatorial Computing (2016)

Wei-Guo Chen and Zhi-Hong Chen

A graph G is collapsible if for every even subset R ⊆ V (G), there is a spanning connected subgraph ...

Properties of Catlin’s reduced graphs and supereulerian graphs

Bulletin of the Institute of Combinatorics and its Applications (2015)

Wei-Guo Chen, Zhi-Hong Chen and Mei Lu

A graph G is called collapsible if for every even subset R ⊆ V (G), there is a spanning connected ...

Lai’s conditions for spanning and dominating closed trails

Electronic Journal of Combinatorics (2015)

Wei-Guo Chen, Zhi-Hong Chen and Mei Lu

Fan-Type Conditions for Spanning Eulerian Subgraphs

Graphs and Combinatorics (2015)

Wei-Guo Chen and Zhi-Hong Chen

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Graphs with a 3-Cycle-2-Cover

Graphs and Combinatorics (2015)

Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai and Mingquan Zhan

Note: full-text not available due to publisher restrictions. Link takes you to an external site where you can purchase the ...

Edge-connectivities for spanning trails with prescribed edges

Ars Combinatoria (2014)

Wei-Guo Chen, Zhi-Hong Chen and Weiqi Luo

Spanning trails in essentially 4-edge-connected graphs

Discrete Applied Mathematics (2014)

Jinquan Xu, Zhi-Hong Chen, Hong-Jian Lai and Meng Zhang

A connected graph G is essentially 4-edge-connected if for any edge cut X of G with |X|<4, either G−X is connected or at most one component of G−X has edges. In ...

On Spanning Disjoint Paths in Line Graphs

Graphs and Combinatorics (2013)

Ye Chen, Zhi-Hong Chen, Hong-Jian Lai, Ping Li, et al.

Spanning connectivity of graphs has been intensively investigated in the study of interconnection networks (Hsu and Lin, Graph Theory and ...

Reinforcing the number of disjoint spanning trees

Ars Combinatoria (2009)

Damin Liu, Hong-Jian Lai and Zhi-Hong Chen

The spanning tree packing number of a connected graph G, denoted by T(G), is the maximum number of edge-disjoint spanning ...

Hamilton-connected indices of graphs

Discrete Mathematics (2009)

Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, et al.

Let G be an undirected graph that is neither a path nor a cycle. Clark and Wormald [L.H. Clark, N.C. Wormald, Hamiltonian-like ...

Collapsible graphs and reductions of line graphs

Discrete Mathematics (2009)

Zhi-Hong Chen, Peter C.B. Lam and Wai-Chee Shiu

A graph G is collapsible if for every even subset X ⊆ V ( G ) , G has a ...

The Hamiltonian index of graphs

Discrete Mathematics (2009)

Yi Hong, Jian-Liang Lin, Zhi-Sui Tao and Zhi-Hong Chen

The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L ...

An s-Hamiltonian Line Graph Problem

Graphs and Combanatorics (2007)

Zhi-Hong Chen, Hong-Jian Lai, Wai-Chee Shiu and Deying Li

For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least ...

Spanning Eulerian Subgraphs in claw-free graphs

Journal of Combinatorial Mathematics and Combinatorial Computing (2006)

Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo and Yehomg Shao

A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at ...

Spanning trails containing given edges

Discrete Mathematics (2006)

Weiqi Luo, Zhi-Hong Chen and Wei-Guo Chen

A graph G is Eulerian-connected if for any u and v in V ( G ) , G has a ...

A tool for understanding multi-language program dependencies

Panagiotis K. Linos, Zhi-Hong Chen, S. Berrier and Brian O'Rourke

This paper describes a prototype tool that facilitates the process of understanding and managing multi-language program dependencies. More specifically, the ...