18 citations · 46 across the 68 of their papers we have counts for
Showing 2017 · cs.DMShow all
2 papers · 2 filters
cs.DM2017
On the Computational Complexity of the Bipartizing Matching Problem
Carlos V. G. C. Lima, Dieter Rautenbach, Uéverton S. Souza +1
We study the problem of determining whether a given graph~ admits a matching~ whose removal destroys all odd cycles of~ (or equivalently whether~ is bipartite).…
cs.DM2017
The Geodetic Hull Number is Hard for Chordal Graphs
Stéphane Bessy, Mitre C. Dourado, Lucia D. Penso +1
We show the hardness of the geodetic hull number for chordal graphs.