Graphs that do not contain a cycle with a node that has at least two neighbors on it. - Archive ouverte HAL Access content directly
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
Not file

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⟩
53 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More