A SUFFICIENT CONDITION for PANCYCLIC GRAPHS

Xingzhi Zhan

doi:10.1017/S0004972724001102

A SUFFICIENT CONDITION for PANCYCLIC GRAPHS

Xingzhi Zhan

School of Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

A graph G is called an [s,t]-graph if any induced subgraph of G of order s has size at least t We prove that every 2-connected [4,2] -graph of order at least 7 is pancyclic. This strengthens existing results. There are 2-connected [4,2]-graphs which do not satisfy the Chvátal-Erdos condition on Hamiltonicity.

Original language	English
Journal	Bulletin of the Australian Mathematical Society
DOIs	https://doi.org/10.1017/S0004972724001102
State	Accepted/In press - 2024

Keywords

05C38
05C42
05C45
05C75
2020 Mathematics subject classification

Access to Document

10.1017/S0004972724001102

Cite this

@article{bb004ee103fe4a21a6f672720d50a541,

title = "A SUFFICIENT CONDITION for PANCYCLIC GRAPHS",

abstract = "A graph G is called an [s,t]-graph if any induced subgraph of G of order s has size at least t We prove that every 2-connected [4,2] -graph of order at least 7 is pancyclic. This strengthens existing results. There are 2-connected [4,2]-graphs which do not satisfy the Chv{\'a}tal-Erdos condition on Hamiltonicity.",

keywords = "05C38, 05C42, 05C45, 05C75, 2020 Mathematics subject classification",

author = "Xingzhi Zhan",

note = "Publisher Copyright: {\textcopyright} The Author(s), 2024.",

year = "2024",

doi = "10.1017/S0004972724001102",

language = "英语",

journal = "Bulletin of the Australian Mathematical Society",

issn = "0004-9727",

publisher = "Cambridge University Press",

}

TY - JOUR

T1 - A SUFFICIENT CONDITION for PANCYCLIC GRAPHS

AU - Zhan, Xingzhi

N1 - Publisher Copyright: © The Author(s), 2024.

PY - 2024

Y1 - 2024

N2 - A graph G is called an [s,t]-graph if any induced subgraph of G of order s has size at least t We prove that every 2-connected [4,2] -graph of order at least 7 is pancyclic. This strengthens existing results. There are 2-connected [4,2]-graphs which do not satisfy the Chvátal-Erdos condition on Hamiltonicity.

AB - A graph G is called an [s,t]-graph if any induced subgraph of G of order s has size at least t We prove that every 2-connected [4,2] -graph of order at least 7 is pancyclic. This strengthens existing results. There are 2-connected [4,2]-graphs which do not satisfy the Chvátal-Erdos condition on Hamiltonicity.

KW - 05C38

KW - 05C42

KW - 05C45

KW - 05C75

KW - 2020 Mathematics subject classification

UR - https://www.scopus.com/pages/publications/85213031391

U2 - 10.1017/S0004972724001102

DO - 10.1017/S0004972724001102

M3 - 文章

AN - SCOPUS:85213031391

SN - 0004-9727

JO - Bulletin of the Australian Mathematical Society

JF - Bulletin of the Australian Mathematical Society

ER -

A SUFFICIENT CONDITION for PANCYCLIC GRAPHS

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this