[a,b]-factors of graphs on surfaces

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

doi:10.1016/j.disc.2019.03.016

[a,b]-factors of graphs on surfaces

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

研究成果: Article › 査読

2 被引用数 (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.

本文言語	English
ページ（範囲）	1979-1988
ページ数	10
ジャーナル	Discrete Mathematics
巻	342
号	7
DOI	https://doi.org/10.1016/j.disc.2019.03.016
出版ステータス	Published - 2019 7月

ASJC Scopus subject areas

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

10.1016/j.disc.2019.03.016

他のファイルとリンク

引用スタイル

@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",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2019",

month = jul,

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

Y1 - 2019/7

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

AN - SCOPUS:85064274539

SN - 0012-365X

VL - 342

SP - 1979

EP - 1988

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 7

ER -

[a,b]-factors of graphs on surfaces

抄録

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル