Circumference, minimum degree and clique number

Long Tu Yuan

doi:10.37236/12322

Circumference, minimum degree and clique number

Long Tu Yuan^*

^*此作品的通讯作者

数学科学学院

科研成果: 期刊稿件 › 文章 › 同行评审

1 引用（Scopus）

摘要

The circumference and the clique number of a graph is the length of a longest cycle and the largest order of a clique in it respectively. We show that the circumference of a 2-connected non-Hamiltonian graph G is at least the sum of its clique number and minimum degree unless G is one of two specific graphs.

源语言	英语
文章编号	P4.65
期刊	Electronic Journal of Combinatorics
卷	31
期	4
DOI	https://doi.org/10.37236/12322
出版状态	已出版 - 2024

访问文件

10.37236/12322

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{8a63617627354830b202c13211c4ec9a,

title = "Circumference, minimum degree and clique number",

abstract = "The circumference and the clique number of a graph is the length of a longest cycle and the largest order of a clique in it respectively. We show that the circumference of a 2-connected non-Hamiltonian graph G is at least the sum of its clique number and minimum degree unless G is one of two specific graphs.",

author = "Yuan, \{Long Tu\}",

note = "Publisher Copyright: {\textcopyright} The author.",

year = "2024",

doi = "10.37236/12322",

language = "英语",

volume = "31",

journal = "Electronic Journal of Combinatorics",

issn = "1097-1440",

publisher = "Australian National University",

number = "4",

}

TY - JOUR

T1 - Circumference, minimum degree and clique number

AU - Yuan, Long Tu

N1 - Publisher Copyright: © The author.

PY - 2024

Y1 - 2024

N2 - The circumference and the clique number of a graph is the length of a longest cycle and the largest order of a clique in it respectively. We show that the circumference of a 2-connected non-Hamiltonian graph G is at least the sum of its clique number and minimum degree unless G is one of two specific graphs.

AB - The circumference and the clique number of a graph is the length of a longest cycle and the largest order of a clique in it respectively. We show that the circumference of a 2-connected non-Hamiltonian graph G is at least the sum of its clique number and minimum degree unless G is one of two specific graphs.

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

U2 - 10.37236/12322

DO - 10.37236/12322

M3 - 文章

AN - SCOPUS:85213339468

SN - 1097-1440

VL - 31

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 4

M1 - P4.65

ER -

Circumference, minimum degree and clique number

摘要

访问文件

其它文件与链接

指纹

引用此