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

Pierre Aboulker 1 Marko Radovanovic Nicolas Trotignon 2 Kristina Vuskovic 3
1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LIP - Laboratoire de l'Informatique du Parallélisme
3 School of Computing [Leeds]
Document type :
Journal articles
Complete list of metadatas
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00800037
Contributor : Nicolas Trotignon <>
Submitted on : Wednesday, March 13, 2013 - 10:01:04 AM
Last modification on : Friday, December 13, 2019 - 9:32:04 AM

Identifiers

  • HAL Id : ensl-00800037, version 1

Collections

UNIV-PARIS7 | ENS-LYON | CNRS | INRIA | LIP | USPC | UNIV-LYON1 | UDL

Citation

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, Society for Industrial and Applied Mathematics, 2012, 26 (4), pp.1510-1531. ⟨ensl-00800037⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

142

Contact

Informations

CCSD