2 papers
cs.CC2025
A Note on the Complexity of Defensive Domination
Steven Chaplick, Grzegorz Gutowski, Tomasz Krawczyk
In a graph G, a k-attack A is any set of at most k vertices and l-defense D is a set of at most l vertices. We say that defense D counters attack A if each a in A can be matched to…
cs.DS2024
Comments on " algorithms for the recognition and isomorphism problems on circular-arc graphs"
Tomasz Krawczyk
In the work [ algorithms for the recognition and isomorphism problems on circular-arc graphs, SIAM J. Comput. 24(3), 411--439, (1995)], Wen-Lian Hsu claims t…