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

Journal articles

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]

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

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

Identifiers

Collections

Citation

Export

Metrics

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

Identifiers

Collections

Citation

Export

Share

Metrics