Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

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 metadata
https://hal-ens-lyon.archives-ouvertes.fr/ensl-00800037
Contributor : Nicolas Trotignon Connect in order to contact the contributor
Submitted on : Wednesday, March 13, 2013 - 10:01:04 AM
Last modification on : Saturday, November 20, 2021 - 3:49:33 AM

Identifiers

  • HAL Id : ensl-00800037, version 1

Collections

ENS-LYON | UNIV-PARIS7 | CNRS | INRIA | UNIV-LYON1 | UDL | UNIV-PARIS

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 Datacite

Share

Metrics

Record views

49