J. Szwarcfiter

activity

20102024

most citedArboricity, h-Index, and Dynamic Algorithms

37 citations · 115 across the 24 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

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~ $G = (V, E)$ admits a matching~ $M$ whose removal destroys all odd cycles of~ $G$ (or equivalently whether~ $G - M$ is bipartite).…

cs.DM2017

Perfect Edge Domination: Hard and Solvable Cases

Min Chih Lin, Vadim Lozin, Veronica A. Moyano +1

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E^{'}$ of edges of $G$ is an edge dominating set of $G$ , if every edge of the g…

math.CO2017

Constant Threshold Intersection Graphs of Orthodox Paths in Trees

Claudson Ferreira Bornstein, José Wilson Coura Pinto, Dieter Rautenbach +1

A graph $G$ belongs to the class $ORTH [h, s, t]$ for integers $h$ , $s$ , and $t$ if there is a pair $(T, S)$ , where $T$ is a tree of maximum degree at most $h$ , and ${\cal…