Numero heterocromatico lineal en graficas - Juan José Montellano-Ballesteros (1999)

Totally Multicoloured Cycles. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Electron. Notes Discret. Math., 2000)

An Anti-Ramsey Theorem. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Comb., 2002)

A Linear Heterochromatic Number of Graphs. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Graphs Comb., 2003)

Polychromatic cliques. - Pavol Hell; Juan José Montellano-Ballesteros (Discret. Math., 2004)

Counting polytopes via the Radon complex. - Juan José Montellano-Ballesteros; Ricardo Strausz (J. Comb. Theory A, 2004)

Cages: constructions and new upper bounds. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros (ISPAN, 2005)

An Anti-Ramsey Theorem on Cycles. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Graphs Comb., 2005)

Tverberg-Type Theorems for Separoids. - Juan José Montellano-Ballesteros; Attila Pór; Ricardo Strausz (Discret. Comput. Geom., 2006)

An anti-Ramsey Theorem on edge-cutsets. - Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2006)

A characterization of cocircuit graphs of uniform oriented matroids. - Juan José Montellano-Ballesteros; Ricardo Strausz (J. Comb. Theory B, 2006)

On totally multicolored stars. - Juan José Montellano-Ballesteros (J. Graph Theory, 2006)

On upper bounds and connectivity of cages. - Gabriela Araujo; Diego González-Moreno; Juan José Montellano-Ballesteros; Oriol Serra (Australas. J Comb., 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)

On a heterochromatic number for hypercubes. - Juan José Montellano-Ballesteros; Victor Neumann-Lara; Eduardo Rivera-Campo (Discret. Math., 2008)

Totally Multicolored diamonds. - Juan José Montellano-Ballesteros (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)

Independent transversals of longest paths in locally semicomplete and transitive digraphs. - Hortensia Galeana-Sánchez; Ricardo Gómez; Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2009)

Polynomial Time Recognition of Uniform Cocircuit Graphs. - Ricardo Gómez Aiza; Juan José Montellano-Ballesteros; Ricardo Strausz; Kolja B. Knauer (Electron. Notes Discret. Math., 2009)

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)

An Anti-Ramsey Theorem on Diamonds. - Juan José Montellano-Ballesteros (Graphs Comb., 2010)

Cubic time recognition of cocircuit graphs of uniform oriented matroids. - Stefan Felsner; Ricardo Gómez Aiza; Kolja B. Knauer; Juan José Montellano-Ballesteros; Ricardo Strausz (Eur. J. Comb., 2011)

A graph-theoretical axiomatization of oriented matroids. - Kolja B. Knauer; Juan José Montellano-Ballesteros; Ricardo Strausz (Electron. Notes Discret. Math., 2011)

On the pseudoachromatic index of the complete graph. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Ricardo Strausz (J. Graph Theory, 2011)

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)

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

A note on the upper bound and girth pair of (k;g)-cages. - Camino Balbuena; Diego González-Moreno; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2013)

On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids. - Juan José Montellano-Ballesteros; Eduardo Rivera-Campo (Graphs Comb., 2013)

On the structure of strong k-transitive digraphs. - César Hernández-Cruz; Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2014)

Π-Kernels in Digraphs. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Graphs Comb., 2015)

Richardson's Theorem for k-colored kernels in strongly connected digraphs. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Discret. Appl. Math., 2016)

Strong subtournaments and cycles of multipartite tournaments. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Discret. Math., 2016)

Rainbow Connection in Some Digraphs. - Jesús Alva-Samos; Juan José Montellano-Ballesteros (Graphs Comb., 2016)

On Heterochromatic Out-directed Spanning Trees in Tournaments. - Juan José Montellano-Ballesteros; Eduardo Rivera-Campo (Graphs Comb., 2016)

A Richardson's theorem version for ⊓-kernels. - Hortensia Galeana-Sánchez; Juan José Montellano-Ballesteros (Discret. Math., 2017)

Monochromatic connecting colorings in strongly connected oriented graphs. - Diego González-Moreno; Mucuy-kak Guevara; Juan José Montellano-Ballesteros (Discret. Math., 2017)

Rainbow connectivity of cacti and some infinite digraphs. - Jesús Alva-Samos; Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2017)

The Strong Convexity Spectra of Grids. - Gabriela Araujo-Pardo; César Hernández-Cruz; Juan José Montellano-Ballesteros (Graphs Comb., 2017)

The Diachromatic Number of Digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Electron. J. Comb., 2018)

Some heterochromatic theorems for matroids. - Criel Merino; Juan José Montellano-Ballesteros (Discret. Math., 2018)

On the Pseudoachromatic Index of the Complete Graph III. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Christian Rubio-Montiel; Ricardo Strausz (Graphs Comb., 2018)

Hamiltonian normal Cayley graphs. - Anahy Santiago Arguello; Juan José Montellano-Ballesteros (Discuss. Math. Graph Theory, 2019)

Mixed Cages. - Gabriela Araujo-Pardo; César Hernández-Cruz; Juan José Montellano-Ballesteros (Graphs Comb., 2019)

Hamiltonian Cycles in Normal Cayley Graphs. - Juan José Montellano-Ballesteros; Anahy Santiago Arguello (Graphs Comb., 2019)

Vertex-monochromatic connectivity of strong digraphs. - Diego González-Moreno; Mucuy-kak Guevara; Juan José Montellano-Ballesteros (Discret. Math., 2020)

Achromatic numbers for circulant graphs and digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Discuss. Math. Graph Theory, 2021)

The digrundy number of digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Discret. Appl. Math., 2022)

The Crossing Number of Twisted Graphs. - Bernardo M. Ábrego; Silvia Fernández-Merchant; Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Eduardo Rivera-Campo (Graphs Comb., 2022)

An Anti-Ramsey Theorem of k-Restricted Edge-Cuts. - Diego González-Moreno; Mucuy-kak Guevara; Juan José Montellano-Ballesteros (Graphs Comb., 2022)

On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs. - Juan José Montellano-Ballesteros; Eduardo Rivera-Campo; Ricardo Strausz (Graphs Comb., 2022)

Transversals of Total Strict Linear Orders. - Juan José Montellano-Ballesteros (Order, 2022)

Partition of regular balanced c-tournaments into strongly connected c-tournaments. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Discret. Math., 2023)

Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Australas. J Comb., 2025)