Geodesic
Circumference, minimum degree and clique number
The electronic journal of combinatorics, Tome 31 (2024) no. 4
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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.
DOI : 10.37236/12322
Classification : 05C12, 05C38, 05C69
Mots-clés : Pósa's lemma, minimal crossing pair 
@article{10_37236_12322,
     author = {Long-Tu Yuan},
     title = {Circumference, minimum degree and clique number},
     journal = {The electronic journal of combinatorics},
     year = {2024},
     volume = {31},
     number = {4},
     doi = {10.37236/12322},
     zbl = {1556.05043},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12322/}
}
TY  - JOUR
AU  - Long-Tu Yuan
TI  - Circumference, minimum degree and clique number
JO  - The electronic journal of combinatorics
PY  - 2024
VL  - 31
IS  - 4
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12322/
DO  - 10.37236/12322
ID  - 10_37236_12322
ER  - 
%0 Journal Article
%A Long-Tu Yuan
%T Circumference, minimum degree and clique number
%J The electronic journal of combinatorics
%D 2024
%V 31
%N 4
%U http://geodesic.mathdoc.fr/articles/10.37236/12322/
%R 10.37236/12322
%F 10_37236_12322
Long-Tu Yuan. Circumference, minimum degree and clique number. The electronic journal of combinatorics, Tome 31 (2024) no. 4. doi: 10.37236/12322

Cité par Sources :