Graphs that do not contain a cycle with a node that has at least two neighbors on it. - ENS de Lyon - École normale supérieure de Lyon Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Discrete Mathematics Année : 2012

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

Fichier non déposé

Dates et versions

ensl-00800037 , version 1 (13-03-2013)

Identifiants

  • HAL Id : ensl-00800037 , version 1

Citer

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.. SIAM Journal on Discrete Mathematics, 2012, 26 (4), pp.1510-1531. ⟨ensl-00800037⟩
52 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More