[a,b]-factors of graphs on surfaces

Ryota Matsubara, Haruhide Matsuda, Nana Matsuo, Kenta Noguchi, Kenta Ozeki

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A well-known conjecture of Grünbaum (1970) and Nash-Williams (1971) asserts that every 4-connected toroidal graph has a Hamiltonian cycle. Related to this conjecture, Kawarabayashi and Ozeki (2011) proved two results on a 2-factor and a 3-factor. In this paper, motivated by these results, we give several sufficient conditions for a graph embedded in a surface to have an [a,b]-factor. We also show that several conditions are best possible.

Original languageEnglish
Pages (from-to)1979-1988
Number of pages10
JournalDiscrete Mathematics
Issue number7
Publication statusPublished - 2019 Jul


  • Factor
  • Graph
  • Hamiltonian cycle
  • Surface

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of '[a,b]-factors of graphs on surfaces'. Together they form a unique fingerprint.

Cite this