default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan José Montellano-Ballesteros
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j52]Ana Paulina Figueroa, Juan José Montellano-Ballesteros
, Mika Olsen:
Partition of regular balanced c-tournaments into strongly connected c-tournaments. Discret. Math. 346(7): 113459 (2023)- 2022
- [j51]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel:
The digrundy number of digraphs. Discret. Appl. Math. 317: 117-123 (2022) - [j50]Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Ricardo Strausz:
On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs. Graphs Comb. 38(1): 12 (2022) - [j49]Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros:
An Anti-Ramsey Theorem of k-Restricted Edge-Cuts. Graphs Comb. 38(4): 125 (2022) - [j48]Bernardo M. Ábrego, Silvia Fernández-Merchant, Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
The Crossing Number of Twisted Graphs. Graphs Comb. 38(5): 134 (2022) - [j47]Juan José Montellano-Ballesteros:
Transversals of Total Strict Linear Orders. Order 39(1): 7-13 (2022) - 2021
- [j46]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel:
Achromatic numbers for circulant graphs and digraphs. Discuss. Math. Graph Theory 41(3): 713-724 (2021) - 2020
- [j45]Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros:
Vertex-monochromatic connectivity of strong digraphs. Discret. Math. 343(9): 111970 (2020)
2010 – 2019
- 2019
- [j44]Anahy Santiago Arguello, Juan José Montellano-Ballesteros:
Hamiltonian normal Cayley graphs. Discuss. Math. Graph Theory 39(3): 731-740 (2019) - [j43]Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
Mixed Cages. Graphs Comb. 35(5): 989-999 (2019) - [j42]Juan José Montellano-Ballesteros, Anahy Santiago Arguello:
Hamiltonian Cycles in Normal Cayley Graphs. Graphs Comb. 35(6): 1707-1714 (2019) - 2018
- [j41]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen, Christian Rubio-Montiel:
The Diachromatic Number of Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j40]Criel Merino, Juan José Montellano-Ballesteros:
Some heterochromatic theorems for matroids. Discret. Math. 341(10): 2694-2699 (2018) - [j39]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Christian Rubio-Montiel, Ricardo Strausz:
On the Pseudoachromatic Index of the Complete Graph III. Graphs Comb. 34(2): 277-287 (2018) - 2017
- [j38]Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros:
Monochromatic connecting colorings in strongly connected oriented graphs. Discret. Math. 340(4): 578-584 (2017) - [j37]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
A Richardson's theorem version for ⊓-kernels. Discret. Math. 340(5): 984-987 (2017) - [j36]Jesús Alva-Samos, Juan José Montellano-Ballesteros:
Rainbow connectivity of cacti and some infinite digraphs. Discuss. Math. Graph Theory 37(2): 301-313 (2017) - [j35]Gabriela Araujo-Pardo, César Hernández-Cruz, Juan José Montellano-Ballesteros:
The Strong Convexity Spectra of Grids. Graphs Comb. 33(4): 689-713 (2017) - 2016
- [j34]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Richardson's Theorem for k-colored kernels in strongly connected digraphs. Discret. Appl. Math. 203: 47-52 (2016) - [j33]Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen:
Strong subtournaments and cycles of multipartite tournaments. Discret. Math. 339(11): 2793-2803 (2016) - [j32]Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
On Heterochromatic Out-directed Spanning Trees in Tournaments. Graphs Comb. 32(1): 323-332 (2016) - [j31]Jesús Alva-Samos, Juan José Montellano-Ballesteros:
Rainbow Connection in Some Digraphs. Graphs Comb. 32(6): 2199-2209 (2016) - 2015
- [j30]Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros:
Π-Kernels in Digraphs. Graphs Comb. 31(6): 2207-2214 (2015) - 2014
- [j29]César Hernández-Cruz, Juan José Montellano-Ballesteros:
On the structure of strong k-transitive digraphs. Discuss. Math. Graph Theory 34(4): 651-671 (2014) - [j28]Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
A graph-theoretical axiomatization of oriented matroids. Eur. J. Comb. 35: 388-391 (2014) - 2013
- [j27]Camino Balbuena, Diego González-Moreno, Juan José Montellano-Ballesteros:
A note on the upper bound and girth pair of (k;g)-cages. Discret. Appl. Math. 161(6): 853-857 (2013) - [j26]Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids. Graphs Comb. 29(5): 1517-1522 (2013) - 2012
- [j25]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes. Ars Comb. 106: 461-471 (2012) - [j24]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
k-colored kernels. Discret. Appl. Math. 160(13-14): 1971-1978 (2012) - 2011
- [j23]Stefan Felsner, Ricardo Gómez Aiza, Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
Cubic time recognition of cocircuit graphs of uniform oriented matroids. Eur. J. Comb. 32(1): 60-66 (2011) - [j22]Kolja B. Knauer, Juan José Montellano-Ballesteros, Ricardo Strausz:
A graph-theoretical axiomatization of oriented matroids. Electron. Notes Discret. Math. 38: 523-528 (2011) - [j21]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Ricardo Strausz:
On the pseudoachromatic index of the complete graph. J. Graph Theory 66(2): 89-97 (2011) - 2010
- [j20]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Kernels by monochromatic paths in m-colored unions of quasi-transitive digraphs. Discret. Appl. Math. 158(5): 461-466 (2010) - [j19]Juan José Montellano-Ballesteros:
An Anti-Ramsey Theorem on Diamonds. Graphs Comb. 26(2): 283-291 (2010)
2000 – 2009
- 2009
- [j18]Hortensia Galeana-Sánchez, Ricardo Gómez, Juan José Montellano-Ballesteros:
Independent transversals of longest paths in locally semicomplete and transitive digraphs. Discuss. Math. Graph Theory 29(3): 469-480 (2009) - [j17]Ricardo Gómez Aiza, Juan José Montellano-Ballesteros, Ricardo Strausz, Kolja B. Knauer:
Polynomial Time Recognition of Uniform Cocircuit Graphs. Electron. Notes Discret. Math. 35: 29-34 (2009) - 2008
- [j16]Hortensia Galeana-Sánchez, Bernardo Llano, Juan José Montellano-Ballesteros:
Absorbent sets and kernels by monochromatic directed paths in m-colored tournaments. Australas. J Comb. 40: 197-210 (2008) - [j15]Juan José Montellano-Ballesteros, Victor Neumann-Lara, Eduardo Rivera-Campo:
On a heterochromatic number for hypercubes. Discret. Math. 308(16): 3441-3448 (2008) - [j14]Juan José Montellano-Ballesteros:
Totally Multicolored diamonds. Electron. Notes Discret. Math. 30: 231-236 (2008) - [j13]Bernardo Llano, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Ricardo Strausz:
On conjectures of Frankl and El-Zahar. J. Graph Theory 57(4): 344-352 (2008) - 2007
- [j12]Gabriela Araujo, Diego González-Moreno, Juan José Montellano-Ballesteros, Oriol Serra:
On upper bounds and connectivity of cages. Australas. J Comb. 38: 221-228 (2007) - [j11]Gabriela Araujo-Pardo, Diego González-Moreno, Juan José Montellano-Ballesteros, Oriol Serra:
On upper bounds and connectivity of cages. Electron. Notes Discret. Math. 28: 137-140 (2007) - 2006
- [j10]Juan José Montellano-Ballesteros, Attila Pór, Ricardo Strausz:
Tverberg-Type Theorems for Separoids. Discret. Comput. Geom. 35(3): 513-523 (2006) - [j9]Juan José Montellano-Ballesteros:
An anti-Ramsey Theorem on edge-cutsets. Discuss. Math. Graph Theory 26(1): 19-21 (2006) - [j8]Juan José Montellano-Ballesteros, Ricardo Strausz:
A characterization of cocircuit graphs of uniform oriented matroids. J. Comb. Theory B 96(4): 445-454 (2006) - [j7]Juan José Montellano-Ballesteros:
On totally multicolored stars. J. Graph Theory 51(3): 225-243 (2006) - 2005
- [j6]Juan José Montellano-Ballesteros, Victor Neumann-Lara:
An Anti-Ramsey Theorem on Cycles. Graphs Comb. 21(3): 343-354 (2005) - [c1]Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros:
Cages: constructions and new upper bounds. ISPAN 2005: 472-477 - 2004
- [j5]Pavol Hell, Juan José Montellano-Ballesteros:
Polychromatic cliques. Discret. Math. 285(1-3): 319-322 (2004) - [j4]Juan José Montellano-Ballesteros, Ricardo Strausz:
Counting polytopes via the Radon complex. J. Comb. Theory A 106(1): 109-121 (2004) - 2003
- [j3]Juan José Montellano-Ballesteros, Victor Neumann-Lara:
A Linear Heterochromatic Number of Graphs. Graphs Comb. 19(4): 533-536 (2003) - 2002
- [j2]Juan José Montellano-Ballesteros, Victor Neumann-Lara:
An Anti-Ramsey Theorem. Comb. 22(3): 445-449 (2002) - 2000
- [j1]Juan José Montellano-Ballesteros, Victor Neumann-Lara:
Totally Multicoloured Cycles. Electron. Notes Discret. Math. 5: 239-242 (2000)
1990 – 1999
- 1999
- [b1]Juan José Montellano-Ballesteros:
Numero heterocromatico lineal en graficas. UNAM, Mexico, 1999
Coauthor Index
aka: Gabriela Araujo
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
