Criel Merino

According to our database, Criel Merino authored at least 25 papers between 2001 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

The Number of Quasi-Trees in Fans and Wheels.

Criel Merino

Electron. J. Comb., 2023

2019

More connections between the matching polynomial and the chromatic polynomial.

Beatriz Carely Luna-Olivera, Criel Merino, Marcelino Ramírez-Ibáñez

AKCE Int. J. Graphs Comb., 2019

2018

Some heterochromatic theorems for matroids.

Criel Merino, Juan José Montellano-Ballesteros

Discret. Math., 2018

The Structure of Delta-Matroids with Width One Twists.

Carolyn Chun, Rhiannon Hall, Criel Merino, Iain Moffatt, Steven D. Noble

Electron. J. Comb., 2018

2017

On zeros of the characteristic polynomial of matroids of bounded tree-width.

Carolyn Chun, Rhiannon Hall, Criel Merino, Steven D. Noble

Eur. J. Comb., 2017

2014

Critical groups of graphs with dihedral actions.

Darren B. Glass, Criel Merino

Eur. J. Comb., 2014

2012

On the structure of the h-vector of a paving matroid.

Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez, Rafael Villarroel-Flores

Eur. J. Comb., 2012

2011

Some inequalities for the Tutte polynomial.

Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez

Eur. J. Comb., 2011

Graph Polynomials and Their Applications II: Interrelations and Interpretations.

Joanna A. Ellis-Monaghan, Criel Merino

Proceedings of the Structural Analysis of Complex Networks, 2011

Graph Polynomials and Their Applications I: The Tutte Polynomial.

Joanna A. Ellis-Monaghan, Criel Merino

Proceedings of the Structural Analysis of Complex Networks, 2011

2009

On Polygons Enclosing Point Sets II.

Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura

Graphs Comb., 2009

A note on some inequalities for the Tutte polynomial of a matroid.

Criel Merino, Marcelino Ramírez-Ibáñez, M. Guadalupe Rodríguez

Electron. Notes Discret. Math., 2009

The Equivalence of Two Graph Polynomials and a Symmetric Function.

Criel Merino, Steven D. Noble

Comb. Probab. Comput., 2009

2008

On the number of tilings of the rectangular board with T-tetronimoes.

Criel Merino

Australas. J Comb., 2008

2007

Simple Euclidean Arrangements with No (>= 5)-Gons.

Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia

Discret. Comput. Geom., 2007

2006

On the length of longest alternating paths for multicoloured point sets in convex position.

Criel Merino, Gelasio Salazar, Jorge Urrutia

Discret. Math., 2006

2005

On plane spanning trees and cycles of multicolored point sets with few intersections.

Mikio Kano, Criel Merino, Jorge Urrutia

Inf. Process. Lett., 2005

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.

Criel Merino, Gelasio Salazar, Jorge Urrutia

Graphs Comb., 2005

The chip-firing game.

Criel Merino

Discret. Math., 2005

Application of a Digital Deconvolution Technique to Brain Temperature Measurement and Its Correlation with Other Physiological Parameters.

Criel Merino, M. L. Luis-Garcia, S. E. Hernandez, F. A. Martin, O. Casanova, D. Gomez, M. A. Castellano, José L. González-Mora

Proceedings of the 18th IEEE Symposium on Computer-Based Medical Systems (CBMS 2005), 2005

2004

A Problem on Hinged Dissections with Colours.

Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia

Graphs Comb., 2004

2003

Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice.

Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy

Electron. J. Comb., 2003

Spanning Trees of Multicoloured Point Sets with Few Intersections.

Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia

Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2001

Irreducibility of the Tutte Polynomial of a Connected Matroid.

Criel Merino, Anna de Mier, Marc Noy

J. Comb. Theory B, 2001

The Chip Firing Game and Matroid Complexes.

Criel Merino

Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001