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
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.

Domaines

Informatique [cs]

Nicolas Trotignon  : Connectez-vous pour contacter le contributeur

https://ens-lyon.hal.science/ensl-00800037

Soumis le : mercredi 13 mars 2013-10:01:04

Dernière modification le : mardi 12 novembre 2024-15:20:06

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⟩

Exporter

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

ENS-LYON UNIV-PARIS7 CNRS INRIA UNIV-LYON1 UDL
69 Consultations
0 Téléchargements

Partager

More