Search
Now showing items 11-20 of 20
Locally searching for large induced matchings
Fürst, Maximilian; Leichter, Marilena; Rautenbach, Dieter (2018)
Wissenschaftlicher Artikel
On the hardness of finding the geodetic number of a subcubic graph
Bueno, Leticia R. et al. (2018)
Wissenschaftlicher Artikel
THE GEODETIC HULL NUMBER IS HARD FOR CHORDAL GRAPHS
Bessy, Stephane et al. (2018)
Wissenschaftlicher Artikel
On some graphs with a unique perfect matching
Chaplick, Steven et al. (2018)
Wissenschaftlicher Artikel
Graphs in which some and every maximum matching is uniquely restricted
Penso, Lucia Draque; Rautenbach, Dieter; Souza, Ueverton dos Santos (2018)
Wissenschaftlicher Artikel
Dominating sets inducing large components in maximal outerplanar graphs
Alvarado, Jose D.; Dantas, Simone; Rautenbach, Dieter (2018)
Wissenschaftlicher Artikel
Bounds on the burning number
Bessy, Stephane et al. (2018)
Wissenschaftlicher Artikel
Some bounds on the zero forcing number of a graph
Gentner, Michael; Rautenbach, Dieter (2018)
Wissenschaftlicher Artikel
And/or-convexity: a graph convexity based on processes and deadlock models
Lima, Carlos V. G. C. et al. (2018)
Wissenschaftlicher Artikel
How to determine if a random graph with a fixed degree sequence has a giant component
Joos, Felix et al. (2018)
Wissenschaftlicher Artikel