A Note on [k, l]-sparse Graphs
Zsolt Fekete, László Szegő · Birkhäuser Basel eBooks · 2006
In this note we provide a Henneberg-type constructive characterization theorem of [ k, l ]-sparse graphs, that is, the graphs for which the number of induced edges in any subset X of nodes is at most κ | X | − l . We consider the case 0 ≤ l ≤ κ .