Sanka, Masahiro

1. Hamiltonian cycles in 2-tough 2K₂-free graphs
   2021/03/11 by Katsuhiro Ota, Masahiro Sanka, Ota, Katsuhiro +1 · 3 citations
   Computer Science · Mathematics · #05C38 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
2. An Ore-type condition for hamiltonicity in tough graphs and the extremal examples
   2022/10/31 by Sanka, Masahiro, Shan, Songling · 1 citation
   Computer Science · Mathematics · Neuroscience · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Nuclear Receptors and Signaling
3. Some conditions for hamiltonian cycles in 1-tough (K₂ ∪ kK₁)-free graphs
   2022/10/19 by Katsuhiro Ota, Ota, Katsuhiro, Masahiro Sanka +1 · 1 citation
   Computer Science · Mathematics · #05C38 #05C42 #05C45 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory