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 SIAM Journal on Discrete Mathematics Year : 2012

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

(1) , , (2) , (3)

1
2
3

Pierre Aboulker

Function : Author
PersonId : 764463
ORCID : 0000-0003-2532-1516
IdRef : 175474362

Laboratoire d'informatique Algorithmique : Fondements et Applications

Marko Radovanovic

Function : Author

Nicolas Trotignon

Function : Author
PersonId : 171871
IdHAL : nicolas-trotignon
ORCID : 0000-0003-1978-0687
IdRef : 082950202

Laboratoire de l'Informatique du Parallélisme

CV

Kristina Vuskovic

Function : Author

School of Computing [Leeds]

Nicolas Trotignon : Connect in order to contact the contributor

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00800037

Submitted on : Wednesday, March 13, 2013-10:01:04 AM

Last modification on : Thursday, September 29, 2022-2:58:07 PM

Dates and versions

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

Identifiers

HAL Id : ensl-00800037 , version 1

Cite

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⟩

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

Dates and versions

Identifiers

Cite

Export

Collections

Share