default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis Pedro Montejano 0001
Person information
- affiliation: Université Montpellier, France
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j23]Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano
:
On k-neighborly reorientations of oriented matroids. Eur. J. Comb. 118: 103938 (2024)- 2021
- [j22]Ignacio García-Marco, Kolja Knauer, Luis Pedro Montejano:
Chomp on generalized Kneser graphs and others. Int. J. Game Theory 50(3): 603-621 (2021) - [j21]Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez:
Secure domination in rooted product graphs. J. Comb. Optim. 41(2): 401-413 (2021) - [j20]Abel Cabrera Martínez, Luis Pedro Montejano, Juan A. Rodríguez-Velázquez:
Correction: Cabrera Martínez et al. On the Secure Total Domination Number of Graphs. Symmetry 2019, 11, 1165. Symmetry 13(9): 1668 (2021) - 2019
- [j19]Abel Cabrera Martínez, Luis Pedro Montejano, Juan A. Rodríguez-Velázquez:
Total Weak Roman Domination in Graphs. Symmetry 11(6): 831 (2019) - [j18]Abel Cabrera Martínez, Luis Pedro Montejano, Juan A. Rodríguez-Velázquez:
On the Secure Total Domination Number of Graphs. Symmetry 11(9): 1165 (2019) - 2018
- [j17]Kolja Knauer, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín:
How Many Circuits Determine an Oriented Matroid? Comb. 38(4): 861-885 (2018) - [j16]Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Montejano, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín:
Codimension Two and Three Kneser Transversals. SIAM J. Discret. Math. 32(2): 1351-1363 (2018) - 2017
- [j15]Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Montejano, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín:
Complete Kneser transversals. Adv. Appl. Math. 82: 83-101 (2017) - [j14]Luis Pedro Montejano, Jonathan Chappelon, Jorge Luis Ramírez Alfonsín:
Ramsey for complete graphs with a dropped edge or a triangle. Electron. Notes Discret. Math. 62: 21-25 (2017) - [j13]Luis Pedro Montejano, Ignasi Sau:
On the complexity of computing the k-restricted edge-connectivity of a graph. Theor. Comput. Sci. 662: 31-39 (2017) - 2016
- [j12]Jonathan Chappelon, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín:
On Ramsey numbers of complete graphs with dropped stars. Discret. Appl. Math. 210: 200-206 (2016) - 2015
- [j11]Luis Pedro Montejano, Jorge L. Ramírez Alfonsín:
Roudneff's Conjecture for Lawrence Oriented Matroids. Electron. J. Comb. 22(2): 2 (2015) - [j10]Jonathan Chappelon, Luis Pedro Montejano, Jorge L. Ramírez Alfonsín, Leonardo Martínez-Sandoval, Luis Montejano:
Kneser Transversals. Electron. Notes Discret. Math. 50: 385-390 (2015) - [j9]Jonathan Chappelon, Ignacio García-Marco, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín:
Möbius function of semigroup posets through Hilbert series. J. Comb. Theory A 136: 238-251 (2015) - 2014
- [j8]Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano:
On the connectivity and restricted edge-connectivity of 3-arc graphs. Discret. Appl. Math. 162: 90-99 (2014) - 2013
- [j7]Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
On the super-restricted arc-connectivity of s -geodetic digraphs. Networks 61(1): 20-28 (2013) - 2012
- [j6]Camino Balbuena, Pedro García-Vázquez, Adriana Hansberg, Luis Pedro Montejano:
Restricted arc-connectivity of generalized p-cycles. Discret. Appl. Math. 160(9): 1325-1332 (2012) - [j5]Andreas Holtkamp, Dirk Meierling, Luis Pedro Montejano:
k-restricted edge-connectivity in triangle-free graphs. Discret. Appl. Math. 160(9): 1345-1355 (2012) - 2011
- [j4]Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano, Julián Salas:
On the λ′-optimality in graphs with odd girth g and even girth h. Appl. Math. Lett. 24(7): 1041-1045 (2011) - [j3]Camino Balbuena, Pedro García-Vázquez, Luis Pedro Montejano:
Superconnectivity of graphs with odd girth g and even girth h. Discret. Appl. Math. 159(2-3): 91-99 (2011) - 2010
- [j2]Camino Balbuena, Kim Marshall, Luis Pedro Montejano:
On the connectivity and superconnected graphs with small diameter. Discret. Appl. Math. 158(5): 397-403 (2010) - 2009
- [j1]Luis Pedro Montejano, Camino Balbuena, Pedro García-Vázquez:
On the Superconnectivity in graphs with odd girth g and even girth h. Electron. Notes Discret. Math. 34: 537-541 (2009)
Conference and Workshop Papers
- 2015
- [c1]Luis Pedro Montejano, Ignasi Sau:
On the Complexity of Computing the k-restricted Edge-connectivity of a Graph. WG 2015: 219-233
Informal and Other Publications
- 2023
- [i4]Rangel Hernández-Ortiz, Kolja Knauer, Luis Pedro Montejano, Manfred Scheucher:
Roudneff's Conjecture in Dimension 4. CoRR abs/2303.14212 (2023) - 2016
- [i3]Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Pedro Montejano, Luis Montejano, Jorge L. Ramírez Alfonsín:
Codimension two and three Kneser Transversals. CoRR abs/1601.00421 (2016) - 2015
- [i2]Luis Pedro Montejano, Ignasi Sau:
On the complexity of computing the k-restricted edge-connectivity of a graph. CoRR abs/1502.07659 (2015) - [i1]Jonathan Chappelon, Leonardo Martínez-Sandoval, Luis Pedro Montejano, Luis Montejano, Jorge L. Ramírez Alfonsín:
Complete Kneser Transversals. CoRR abs/1511.01315 (2015)
Coauthor Index
aka: Jorge Luis Ramírez Alfonsín
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-08-05 21:24 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:
