Ecuaciones tensas y no tensas - Bernardo Llano (1996)

Mean value for the matching and dominating polynomial. - Jorge L. Arocha; Bernardo Llano (Discuss. Math. Graph Theory, 2000)

Infinite families of tight regular tournaments. - Bernardo Llano; Mika Olsen (Discuss. Math. Graph Theory, 2007)

Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Australas. J Comb., 2008)

Circulant tournaments of prime order are tight. - Bernardo Llano; Victor Neumann-Lara (Discret. Math., 2008)

On a Conjecture of Víctor Neumann-Lara. - Bernardo Llano; Mika Olsen (Electron. Notes Discret. Math., 2008)

On conjectures of Frankl and El-Zahar. - Bernardo Llano; Juan José Montellano-Ballesteros; Eduardo Rivera-Campo; Ricardo Strausz (J. Graph Theory, 2008)

An infinite family of self-diclique digraphs. - Ana Paulina Figueroa; Bernardo Llano (Appl. Math. Lett., 2010)

Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2010)

On the Maximum Number of Translates in a Point Set. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Bernardo Llano (Discret. Comput. Geom., 2010)

The number of C3-free vertices on 3-partite tournaments. - Ana Paulina Figueroa; Bernardo Llano; Rita Zuazua (Discret. Math., 2010)

Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Ars Comb., 2012)

On the acyclic disconnection of multipartite tournaments. - Ana Paulina Figueroa; Bernardo Llano; Mika Olsen; Eduardo Rivera-Campo (Discret. Appl. Math., 2012)

k-colored kernels. - Hortensia Galeana-Sánchez; Bernardo Llano; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2012)

Rainbow-free colorings for x+y=cz in Zp. - Bernardo Llano; Amanda Montejano (Discret. Math., 2012)

The acyclic and C⃗3-free disconnection of tournaments. - José Luis Cosme-Álvarez; Bernardo Llano (Discret. Math., 2013)

Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. - Susan A. van Aardt; Alewyn P. Burger; Marietjie Frick; Bernardo Llano; Rita Zuazua (Graphs Comb., 2014)

Destroying longest cycles in graphs and digraphs. - Susan A. van Aardt; Alewyn P. Burger; Jean E. Dunbar; Marietjie Frick; Bernardo Llano; Carsten Thomassen; Rita Zuazua (Discret. Appl. Math., 2015)

Disproof of a Conjecture of Neumann-Lara. - Bernardo Llano; Mika Olsen (Electron. J. Comb., 2017)

The dichromatic number of infinite families of circulant tournaments. - Nahid Javier; Bernardo Llano (Discuss. Math. Graph Theory, 2017)

A Note on the Feedback Arc Set Problem and Acyclic Subdigraphs in Bipartite Tournaments. - Diego González-Moreno; Bernardo Llano; Eduardo Rivera-Campo (J. Interconnect. Networks, 2017)

The Dichromatic Polynomial of a Digraph. - Diego González-Moreno; Rangel Hernández-Ortiz; Bernardo Llano; Mika Olsen (Graphs Comb., 2022)

Diclique digraphs. - Marisa Gutierrez; Bernardo Llano; Miguel A. Pizaña; Silvia B. Tondato (Discret. Appl. Math., 2024)