[HTML][HTML] Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
We perform a systematic study in the computational complexity of the connected variant of
three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle …
three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle …
[HTML][HTML] On line graphs of subcubic triangle-free graphs
A Munaro - Discrete Mathematics, 2017 - Elsevier
Line graphs constitute a rich and well-studied class of graphs. In this paper, we focus on
three different topics related to line graphs of subcubic triangle-free graphs. First, we show …
three different topics related to line graphs of subcubic triangle-free graphs. First, we show …
Jones' Conjecture in subcubic graphs
Jones’ Conjecture in subcubic graphs arXiv:1912.01570v1 [math.CO] 3 Dec 2019 Page 1
Jones’ Conjecture in subcubic graphs ∗ Marthe Bonamy1, François Dross2, Tomáš Masařík2 …
Jones’ Conjecture in subcubic graphs ∗ Marthe Bonamy1, François Dross2, Tomáš Masařík2 …