Search
Now showing items 11-15 of 15
A lower bound on the independence number of a graph in terms of degrees and local clique sizes
Brause, Christoph et al. (2016)
Beitrag zu einer Konferenz
Independence in uniform linear triangle-free hypergraphs
Borowiecki, Piotr et al. (2016)
Beitrag zu einer Konferenz
Near-linear-time algorithm for the geodetic Radon number of grids
Dourado, Mitre Costa et al. (2016)
Beitrag zu einer Konferenz
Slash and burn on graphs - Firefighting with general weights
Costa, Vitor et al. (2016)
Beitrag zu einer Konferenz
How to determine if a random graph with a fixed degree sequence has a giant component
Joos, Felix et al. (2016)
Beitrag zu einer Konferenz