2 papers
math.CO2023
A necessary and sufficient condition for the existence of a properly coloured -factor in an edge-coloured graph
Roman Čada, Michitaka Furuya, Kenji Kimura +3
The main result of this paper is an edge-coloured version of Tutte's -factor theorem. We give a necessary and sufficient condition for an edge-coloured graph to have a pro…
math.CO2018
A degree sum condition on the order, the connectivity and the independence number for Hamiltonicity
S. Chiba, M. Furuya, K. Ozeki +2
In [Graphs Combin.~24 (2008) 469--483.], the third author and the fifth author conjectured that if is a -connected graph such that …