default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 25 matches
- 2023
- Criel Merino:
The Number of Quasi-Trees in Fans and Wheels. Electron. J. Comb. 30(1) (2023) - 2019
- Beatriz Carely Luna-Olivera, Criel Merino, Marcelino Ramírez-Ibáñez:
More connections between the matching polynomial and the chromatic polynomial. AKCE Int. J. Graphs Comb. 16(3): 319-323 (2019) - 2018
- Carolyn Chun, Rhiannon Hall, Criel Merino, Iain Moffatt, Steven D. Noble:
The Structure of Delta-Matroids with Width One Twists. Electron. J. Comb. 25(1): 1 (2018) - Criel Merino, Juan José Montellano-Ballesteros:
Some heterochromatic theorems for matroids. Discret. Math. 341(10): 2694-2699 (2018) - 2017
- Carolyn Chun, Rhiannon Hall, Criel Merino, Steven D. Noble:
On zeros of the characteristic polynomial of matroids of bounded tree-width. Eur. J. Comb. 60: 10-20 (2017) - 2014
- Darren B. Glass, Criel Merino:
Critical groups of graphs with dihedral actions. Eur. J. Comb. 39: 95-112 (2014) - 2012
- Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez, Rafael Villarroel-Flores:
On the structure of the h-vector of a paving matroid. Eur. J. Comb. 33(8): 1787-1799 (2012) - 2011
- Laura Chávez-Lomelí, Criel Merino, Steven D. Noble, Marcelino Ramírez-Ibáñez:
Some inequalities for the Tutte polynomial. Eur. J. Comb. 32(3): 422-433 (2011) - Joanna A. Ellis-Monaghan, Criel Merino:
Graph Polynomials and Their Applications I: The Tutte Polynomial. Structural Analysis of Complex Networks 2011: 219-255 - Joanna A. Ellis-Monaghan, Criel Merino:
Graph Polynomials and Their Applications II: Interrelations and Interpretations. Structural Analysis of Complex Networks 2011: 257-292 - 2009
- Criel Merino, Steven D. Noble:
The Equivalence of Two Graph Polynomials and a Symmetric Function. Comb. Probab. Comput. 18(4): 601-615 (2009) - Criel Merino, Marcelino Ramírez-Ibáñez, M. Guadalupe Rodríguez:
A note on some inequalities for the Tutte polynomial of a matroid. Electron. Notes Discret. Math. 34: 603-607 (2009) - Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On Polygons Enclosing Point Sets II. Graphs Comb. 25(3): 327-339 (2009) - 2008
- Criel Merino:
On the number of tilings of the rectangular board with T-tetronimoes. Australas. J Comb. 41: 107-114 (2008) - 2007
- Jesús Leaños, Mario Lomelí-Haro, Criel Merino, Gelasio Salazar, Jorge Urrutia:
Simple Euclidean Arrangements with No (>= 5)-Gons. Discret. Comput. Geom. 38(3): 595-603 (2007) - 2006
- Criel Merino, Gelasio Salazar, Jorge Urrutia:
On the length of longest alternating paths for multicoloured point sets in convex position. Discret. Math. 306(15): 1791-1797 (2006) - 2005
- Criel Merino:
The chip-firing game. Discret. Math. 302(1-3): 188-210 (2005) - Criel Merino, Gelasio Salazar, Jorge Urrutia:
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets. Graphs Comb. 21(3): 333-341 (2005) - Mikio Kano, Criel Merino, Jorge Urrutia:
On plane spanning trees and cycles of multicolored point sets with few intersections. Inf. Process. Lett. 93(6): 301-306 (2005) - Criel Merino, M. L. Luis-Garcia, S. E. Hernandez, F. A. Martin, O. Casanova, D. Gomez, M. A. Castellano, José L. González-Mora:
Application of a Digital Deconvolution Technique to Brain Temperature Measurement and Its Correlation with Other Physiological Parameters. CBMS 2005: 47-53 - 2004
- Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia:
A Problem on Hinged Dissections with Colours. Graphs Comb. 20(2): 145-159 (2004) - 2003
- Neil J. Calkin, Criel Merino, Steven D. Noble, Marc Noy:
Improved Bounds for the Number of Forests and Acyclic Orientations in the Square Lattice. Electron. J. Comb. 10 (2003) - Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia:
Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122 - 2001
- Criel Merino, Anna de Mier, Marc Noy:
Irreducibility of the Tutte Polynomial of a Connected Matroid. J. Comb. Theory B 83(2): 298-304 (2001) - Criel Merino:
The Chip Firing Game and Matroid Complexes. DM-CCG 2001: 245-256
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-28 13:20 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint