Publications (18)
Regular colorings and factors of regular graphs
Anton Bernshteyn, Omid Khormali, Ryan R. Martin +4
Difference of forbidden pairs containing a claw
Guantao Chen, Michitaka Furuya, Songling Shan +2
Minimum degree condition for spanning generalized Halin graphs
Guantao Chen, Songling Shan, Ping Yang
Vizing's 2-factor Conjecture Involving Toughness and Maximum Degree Conditions
Jinko Kanno, Songling Shan
Nonempty intersection of longest paths in $2K_2$-free graphs
Gili Golan, Songling Shan
Nonempty intersection of longest paths in graphs without forbidden pairs
Yuping Gao, Songling Shan
The paper proves that Gallai's question—whether all longest paths in a connected graph share a vertex—holds for any connected graph that avoids a specific pair of forbidden subgrap…
Dirac's Condition for Spanning Halin Subgraphs
Guantao Chen, Songling Shan
Toughness and prism-hamiltonicity of $P_4$-free graphs
M. N. Ellingham, Pouria Salehi Nowbandegani, Songling Shan
Hamiltonian cycles in 3-tough $2K_2$-free graphs
Songling Shan
Chromatic index determined by fractional chromatic index
Guantao Chen, Yuping Gao, Ringi Kim +2
Antimagic orientation of biregular bipartite graphs
Songling Shan, Xiaowei Yu
Characterizing forbidden pairs for hamiltonian squares
Guantao Chen, Songling Shan
Vizing's 2-factor Conjecture Involving Large Maximum Degree
Guantao Chen, Songling Shan
Hamiltonian cycles in tough $(P_2\cup P_3)$-free graphs
Songling Shan
Independence number of edge-chromatic critical graphs
Yan Cao, Guantao Chen, Guangming Jing +1
Spanning trails with maximum degree at most 4 in $2K_2$-free graphs
Guantao Chen, M. N. Ellingham, Akira Saito +1
A Note On Vertex Distinguishing Edge colorings of Trees
Songling Shan, Bing Yao
Toughness and spanning trees in $K_4$-minor-free graphs
M. N. Ellingham, Songling Shan, Dong Ye +1