Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GraphComb
Implicit degrees and Hamiltonian graph theory
Hao Li

21 September 2012, 10h30 - 21 September 2012, 11h30
Salle/Bat : 475/PCRI-N
Contact :

Activités de recherche :

Résumé :
Dirac showed in 1952 that every graph of order $n$ is Hamiltonian if any vertex is of degree at least n/2. In order to deal with the case that some vertices may have small degrees, Zhi, Li and Deng defined implicit degrees for a vertex v by using the degrees of vertices that has distance at most 2 from v and obtained sufficient conditions with implicit degrees for Hamiltonian problems in 1989. In this talk, we present new results on implicit degree conditions for Hamiltonicty, cyclable, pancyclic, etc.

This is a joint work with Junqing Cai and Wantao Ning

Pour en savoir plus :
Séminaires
Some recent results on the integer linear programm
Théorie des graphes
Friday 30 November 2018 - 00h00
Salle : 445 - PCRI-N
Hung Nguyen .............................................

Maximum Independent Set in H-free graphs
Théorie des graphes
Friday 05 October 2018 - 14h30
Salle : 445 - PCRI-N
Edouard BONNET .............................................

A Family of Tractable Graph Distances
Gestion de données du Web
Wednesday 04 July 2018 - 10h30
Salle : 465 - PCRI-N
Stratis Ioannidis .............................................

Binary pattern of length greater than 14 are abeli
Combinatoire
Friday 29 June 2018 - 14h30
Salle : 445 - PCRI-N
Matthieu Rosenfeld .............................................

Distributionally Robust Optimization with Principa
Optimisation combinatoire et stochastique
Friday 29 June 2018 - 11h00
Salle : 455 - PCRI-N
Dr. Jianqiang Cheng .............................................