Distance Domination and Distance Irredundance in Graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Electron. J. Comb., 2007)

Characterization of block graphs with equal 2-domination number and domination number plus one. - Adriana Hansberg Pastor; Lutz Volkmann (Discuss. Math. Graph Theory, 2007)

A note on the 2-domination number of a tree. - Jun Fujisawa; Adriana Hansberg; Takahiro Kubo; Akira Saito; Masahide Sugita; Lutz Volkmann (Australas. J Comb., 2008)

On graphs with equal domination and 2-domination numbers. - Adriana Hansberg; Lutz Volkmann (Discret. Math., 2008)

On k-domination and minimum degree in graphs. - Odile Favaron; Adriana Hansberg; Lutz Volkmann (J. Graph Theory, 2008)

A characterization of even order trees with domination number half their order minus one. - Adriana Hansberg; Lutz Volkmann (Australas. J Comb., 2009)

Upper bounds on the k-domination number and the k-Roman domination number. - Adriana Hansberg; Lutz Volkmann (Discret. Appl. Math., 2009)

Bounds on the connected k-domination number in graphs. - Adriana Hansberg (Discret. Appl. Math., 2010)

On the geodetic and geodetic domination numbers of a graph. - Adriana Hansberg; Lutz Volkmann (Discret. Math., 2010)

A general method in the theory of domination in graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Int. J. Comput. Math., 2010)

2-domination in bipartite graphs with odd independence number. - Adriana Hansberg; Lutz Volkmann (Australas. J Comb., 2011)

On 2-domination and independence domination numbers of graphs. - Adriana Hansberg; Lutz Volkmann (Ars Comb., 2011)

Independence and k-domination in graphs. - Adriana Hansberg; Dirk Meierling; Lutz Volkmann (Int. J. Comput. Math., 2011)

Degrees in Oriented Hypergraphs and Ramsey p-Chromatic Number. - Yair Caro; Adriana Hansberg (Electron. J. Comb., 2012)

Restricted arc-connectivity of generalized p-cycles. - Camino Balbuena; Pedro García-Vázquez; Adriana Hansberg; Luis Pedro Montejano 001 (Discret. Appl. Math., 2012)

Fair domination in graphs. - Yair Caro; Adriana Hansberg; Michael A. Henning (Discret. Math., 2012)

k-Domination and k-Independence in Graphs: A Survey. - Mustapha Chellali; Odile Favaron; Adriana Hansberg; Lutz Volkmann (Graphs Comb., 2012)

New Approach to the k-Independence Number of a Graph. - Yair Caro; Adriana Hansberg (Electron. J. Comb., 2013)

Partitions of graphs into small and large sets. - Asen Bojilov; Yair Caro; Adriana Hansberg; Nedyalko Nenov (Discret. Appl. Math., 2013)

On kk-domination and jj-independence in graphs. - Adriana Hansberg; Ryan Pepper (Discret. Appl. Math., 2013)

Reviewing some Results on Fair Domination in Graphs. - Adriana Hansberg (Electron. Notes Discret. Math., 2013)

On the super-restricted arc-connectivity of s -geodetic digraphs. - Camino Balbuena; Pedro García-Vázquez; Adriana Hansberg; Luis Pedro Montejano 001 (Networks, 2013)

Locating-Dominating Sets and Identifying Codes in Graphs of Girth at least 5. - Camino Balbuena; Florent Foucaud; Adriana Hansberg (Electron. J. Comb., 2015)

Isolation in graphs. - Adriana Hansberg; Yair Caro (Electron. Notes Discret. Math., 2015)

Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs. - Camino Balbuena; Adriana Hansberg; Teresa W. Haynes; Michael A. Henning (Graphs Comb., 2015)

Regular independent sets. - Yair Caro; Adriana Hansberg; Ryan Pepper (Discret. Appl. Math., 2016)

Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. - Antoine Dailly; Florent Foucaud; Adriana Hansberg (Discret. Math., 2019)

Zero-Sum Km Over Z and the Story of K4. - Yair Caro; Adriana Hansberg; Amanda Montejano (Graphs Comb., 2019)

Zero-sum subsequences in bounded-sum {-1, 1}-sequences. - Yair Caro; Adriana Hansberg; Amanda Montejano (J. Comb. Theory A, 2019)

Recursive constructions of amoebas. - Adriana Hansberg; Amanda Montejano; Yair Caro (LAGOS, 2021)

On the balanceability of some graph classes. - Antoine Dailly; Adriana Hansberg; Denae Ventura (Discret. Appl. Math., 2021)

Unavoidable chromatic patterns in 2-colorings of the complete graph. - Yair Caro; Adriana Hansberg; Amanda Montejano (J. Graph Theory, 2021)

On Zero-Sum Spanning Trees and Zero-Sum Connectivity. - Yair Caro; Adriana Hansberg; Josef Lauri; Christina Zarb (Electron. J. Comb., 2022)

Graphs with constant balancing number. - Yair Caro; Ileana González-Escalante; Adriana Hansberg; Mariel Jácome; Tonatiuh Matos Wiederhold; Amanda Montejano (LAGOS, 2023)

Graphs Isomorphisms Under Edge-Replacements and the Family of Amoebas. - Yair Caro; Adriana Hansberg; Amanda Montejano (Electron. J. Comb., 2023)

The Balancing Number and Generalized Balancing Number of Some Graph Classes. - Antoine Dailly; Laura Eslava; Adriana Hansberg; Denae Ventura (Electron. J. Comb., 2023)

The exact balanced upper chromatic number of the n-cube over t elements. - Gabriela Araujo-Pardo; Silvia Fernández-Merchant; Adriana Hansberg; Dolores Lara; Amanda Montejano; Déborah Oliveros (CCCG, 2024)

Colored Unavoidable Patterns and Balanceable Graphs. - Matt Bowen; Adriana Hansberg; Amanda Montejano; Alp Müyesser (Electron. J. Comb., 2024)

Unavoidable patterns in 2-colorings of the complete bipartite graph. - Adriana Hansberg; Denae Ventura (Discret. Appl. Math., 2025)