Luis Pedro Montejano

Orcid: 0000-0003-3101-6518

Affiliations:
  • Université Montpellier, France
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Luis Pedro Montejano authored at least 23 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On k-neighborly reorientations of oriented matroids.
Eur. J. Comb., 2024

2023
Roudneff's Conjecture in Dimension 4.
CoRR, 2023

2021
Correction: Cabrera Martínez et al. On the Secure Total Domination Number of Graphs. Symmetry 2019, 11, 1165.
Symmetry, 2021

Secure domination in rooted product graphs.
J. Comb. Optim., 2021

Chomp on generalized Kneser graphs and others.
Int. J. Game Theory, 2021

2019
On the Secure Total Domination Number of Graphs.
Symmetry, 2019

Total Weak Roman Domination in Graphs.
Symmetry, 2019

2018
Codimension Two and Three Kneser Transversals.
SIAM J. Discret. Math., 2018

How Many Circuits Determine an Oriented Matroid?
Comb., 2018

2017
On the complexity of computing the k-restricted edge-connectivity of a graph.
Theor. Comput. Sci., 2017

Ramsey for complete graphs with a dropped edge or a triangle.
Electron. Notes Discret. Math., 2017

Complete Kneser transversals.
Adv. Appl. Math., 2017

2016
On Ramsey numbers of complete graphs with dropped stars.
Discret. Appl. Math., 2016

2015
Möbius function of semigroup posets through Hilbert series.
J. Comb. Theory A, 2015

Kneser Transversals.
Electron. Notes Discret. Math., 2015

Roudneff's Conjecture for Lawrence Oriented Matroids.
Electron. J. Comb., 2015

2014
On the connectivity and restricted edge-connectivity of 3-arc graphs.
Discret. Appl. Math., 2014

2013
On the super-restricted arc-connectivity of <i>s</i> -geodetic digraphs.
Networks, 2013

2012
k-restricted edge-connectivity in triangle-free graphs.
Discret. Appl. Math., 2012

Restricted arc-connectivity of generalized p-cycles.
Discret. Appl. Math., 2012

2011
Superconnectivity of graphs with odd girth g and even girth h.
Discret. Appl. Math., 2011

On the λ<sup>′</sup>-optimality in graphs with odd girth g and even girth h.
Appl. Math. Lett., 2011

2010
On the connectivity and superconnected graphs with small diameter.
Discret. Appl. Math., 2010


  Loading...