Discrete Mathematics · Computer Science
Upper Domination: towards a dichotomy through boundary properties
Hassan AbouEisha, Shahid Hussain, Vadim Lozin, Jérôme Monnot +2
2016-09-07
Data Structures and Algorithms · Computer Science
On 3-Coloring of $(2P_4,C_5)$-Free Graphs
Vít Jelínek, Tereza Klimošová, Tomáš Masařík, Jana Novotná +1
2024-01-12
Combinatorics · Mathematics
On the complexity of Dominating Set for graphs with fixed diameter
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
2023-04-20
Combinatorics · Mathematics
On Minimum Dominating Sets in cubic and (claw,H)-free graphs
Valentin Bouquet, François Delbot, Christophe Picouleau, Stéphane Rovedakis
2020-02-28
Combinatorics · Mathematics
Using edge contractions to reduce the semitotal domination number
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
2021-07-09
Discrete Mathematics · Computer Science
The complexity of dominating set reconfiguration
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura +3
2015-03-04
Combinatorics · Mathematics
Graph Classes Closed under Self-intersection
Konrad K. Dabrowski, Vadim V. Lozin, Martin Milanič, Andrea Munaro +2
2025-11-12
Computational Complexity · Computer Science
Constricting the Computational Complexity Gap of the $4$-Coloring Problem in $(P_t,C_3)$-free Graphs
Justyna Jaworska, Bartłomiej Kielak, Tomáš Masařík, Jana Masaříková
2025-09-03
Data Structures and Algorithms · Computer Science
Complexity dichotomy on partial grid recognition
Vinícius G. P. de Sá, Guilherme D. da Fonseca, Raphael Machado, Celina M. H. de Figueiredo
2012-04-13
Computational Complexity · Computer Science
Algorithmic Aspects of Upper Domination
Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau +5
2015-06-25
Combinatorics · Mathematics
Super Domination: Graph Classes, Products and Enumeration
Nima Ghanbari, Gerold Jäger, Tuomo Lehtilä
2022-11-01