[a,b]-factors of graphs on surfaces

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

Research output: Contribution to journalArticle

Abstract

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
Volume342
Issue number7
DOIs
Publication statusPublished - 2019 Jul 1

Fingerprint

Hamiltonians

Keywords

  • Factor
  • Graph
  • Hamiltonian cycle
  • Surface

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Cite this

[a,b]-factors of graphs on surfaces. / Matsubara, Ryota; Matsuda, Haruhide; Matsuo, Nana; Noguchi, Kenta; Ozeki, Kenta.

In: Discrete Mathematics, Vol. 342, No. 7, 01.07.2019, p. 1979-1988.

Research output: Contribution to journalArticle

Matsubara, Ryota ; Matsuda, Haruhide ; Matsuo, Nana ; Noguchi, Kenta ; Ozeki, Kenta. / [a,b]-factors of graphs on surfaces. In: Discrete Mathematics. 2019 ; Vol. 342, No. 7. pp. 1979-1988.
@article{32fdedcf0fe14e6a8c991243a2437ced,
title = "[a,b]-factors of graphs on surfaces",
abstract = "A well-known conjecture of Gr{\"u}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.",
keywords = "Factor, Graph, Hamiltonian cycle, Surface",
author = "Ryota Matsubara and Haruhide Matsuda and Nana Matsuo and Kenta Noguchi and Kenta Ozeki",
year = "2019",
month = "7",
day = "1",
doi = "10.1016/j.disc.2019.03.016",
language = "English",
volume = "342",
pages = "1979--1988",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - [a,b]-factors of graphs on surfaces

AU - Matsubara, Ryota

AU - Matsuda, Haruhide

AU - Matsuo, Nana

AU - Noguchi, Kenta

AU - Ozeki, Kenta

PY - 2019/7/1

Y1 - 2019/7/1

N2 - 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.

AB - 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.

KW - Factor

KW - Graph

KW - Hamiltonian cycle

KW - Surface

UR - http://www.scopus.com/inward/record.url?scp=85064274539&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85064274539&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2019.03.016

DO - 10.1016/j.disc.2019.03.016

M3 - Article

VL - 342

SP - 1979

EP - 1988

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 7

ER -