Weihua Yang

collaborators

4 papers

math.CO2026

An excluded minor theorem for the 6-wheel

Zijun Chen, Yuqi Xu, Weihua Yang

For each integer $n \geq 3$ , the wheel graph $W_{n}$ is defined as the graph obtained by connecting a single vertex to all vertices of a cycle of length $n$ . In particular, $W_{6}$ can…

math.CO2026

A characterization of 4-connected graphs with no 6-wheel minor

Zijun Chen, Yuqi Xu, Weihua Yang

For each integer $n \geq 3$ , let $W_{n}$ denote the wheel graph obtained by connecting a single vertex to all vertices of a cycle of length $n$ . In particular, $W_{6}$ is obtained from…

math.CO2023

On regular 2-path Hamiltonian graphs

Xia Li, Weihua Yang, Bo Zhang +1

Kronk introduced the $l$ -path hamiltonianicity of graphs in 1969. A graph is $l$ -path Hamiltonian if every path of length not exceeding $l$ is contained in a Hamiltonian cycle. We…

math.CO2023

A characterization of 4-connected graphs with no $K_{3, 3} + v$ -minor

Linsong Wei, Yuqi Xu, Weihua Yang +1

Among graphs with 13 edges, there are exactly three internally 4-connected graphs which are $O c t^{+}$ , cube+e and $K_{3, 3} + v$ . A complete characterization of all 4-connected grap…

An excluded minor theorem for the 6-wheel

A characterization of 4-connected graphs with no 6-wheel minor

On regular 2-path Hamiltonian graphs

A characterization of 4-connected graphs with no K3,3​+v-minor

A characterization of 4-connected graphs with no $K_{3, 3} + v$ -minor