作者：Xiaodong Chen;Mingchu Li;Liming Xiong （¹School of Mathematics, Liaoning Normal University, Dalian 116029, PR China;²School of Software, Dalian University of Technology, Dalian 116024, PR China;³School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing 100081, PR China）

出处：Discrete Mathematics 2022

关键词：Claw-free graphs;Two CISTs;Eligible vertex

摘要：If a graph G contains two spanning trees T 1 , T 2 such that for each two distinct vertices x , y of G, the ( x , y ) -path in each T i has no common ...

作者：Yang, Xiaojing¹;Xiong, Liming²; （¹School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, 100081, China;²School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology, Beijing, 100081, China）

出处：Quaestiones Mathematicae 2021

关键词：Forbidden subgraph;(near) perfect matching;hamiltonian

摘要：Let G = (V (G), E(G)) be a graph. A set M ⊆ E(G) is a matching if no two edges in M share a common vertex. A matching of G is perfect if it covers eve ...

作者：NIU Zhao-hong¹;，XIONG Li-ming²;，YANG Wei-hua³; （¹School of Mathematical Sciences, Shanxi University；²School of Mathematics and Statistics, Beijing Key Laboratory on MCAACI, Beijing Institute of Technology；³Department of Mathematics, Taiyuan University of Technology）

出处：Applied Mathematics:A Journal of Chinese Universities 2024

关键词：iterated line graph；traceable；hamiltonian index；hamiltonian path index

摘要：Xiong and Liu [21] gave a characterization of the graphs G for which the n-iterated line graph Lⁿ（G） is hamiltonian, for n ≥ 2. In this pap ...