Graphs that do not contain a cycle with a node that has at least two neighbors on it.

Pierre Aboulker; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic

Graphs that do not contain a cycle with a node that has at least two neighbors on it.

Pierre Aboulker ¹ Marko Radovanovic Nicolas Trotignon ² Kristina Vuskovic ³

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

2 LIP - Laboratoire de l'Informatique du Parallélisme

3 School of Computing [Leeds]

Type de document :

Article dans une revue

Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (4), pp.1510-1531

Liste complète des métadonnées

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00800037
Contributeur : Nicolas Trotignon <>
Soumis le : mercredi 13 mars 2013 - 10:01:04
Dernière modification le : jeudi 7 février 2019 - 14:28:18

Graphs that do not contain a cycle with a node that has at least two neighbors on it.

Identifiants

Collections

Citation

Exporter

Métriques

103

Contact

Graphs that do not contain a cycle with a node that has at least two neighbors on it.

Identifiants

Collections

Citation

Exporter

Partager

Métriques

103

Contact