3 papers
cs.DM2020
Defensive Domination in Proper Interval Graphs
Tınaz Ekim, Arthur Farley, Andrzej Proskurowski +1
-defensive domination, a variant of the classical domination problem on graphs, seeks a minimum cardinality vertex set providing a surjective defense against any attack on verti…
cs.DS2013
Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs
Hajo Broersma, Jiří Fiala, Petr A. Golovach +3
Hung and Chang showed that for all k>=1 an interval graph has a path cover of size at most k if and only if its scattering number is at most k. They also showed that an interval gr…
cs.DM2011
Obstructions for linear rankwidth at most 1
Isolde Adler, Arthur M. Farley, Andrzej Proskurowski
We provide a characterization of graphs of linear rankwidth at most 1 by minimal excluded vertex-minors.