default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco Larrión
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j29]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores
:
On strong graph bundles. Discret. Math. 340(12): 3073-3080 (2017)- 2016
- [j28]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On self-clique shoal graphs. Discret. Appl. Math. 205: 86-100 (2016) - [j27]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On self-clique graphs with triangular cliques. Discret. Math. 339(2): 457-459 (2016) - 2013
- [j26]Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Edge contraction and edge removal on iterated clique graphs. Discret. Appl. Math. 161(10-11): 1427-1439 (2013) - [j25]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Iterated clique graphs and bordered compact surfaces. Discret. Math. 313(4): 508-516 (2013) - 2011
- [j24]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Small Locally nK2 Graphs. Ars Comb. 102: 385-391 (2011)
2000 – 2009
- 2009
- [j23]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
The clique operator on matching and chessboard graphs. Discret. Math. 309(1): 85-93 (2009) - [j22]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
The fundamental group of the clique graph. Eur. J. Comb. 30(1): 288-294 (2009) - [j21]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
On expansive graphs. Eur. J. Comb. 30(2): 372-379 (2009) - [j20]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On the clique behavior of circulants with three small jumps. Electron. Notes Discret. Math. 35: 341-346 (2009) - 2008
- [j19]Francisco Larrión, Miguel A. Pizaña:
On hereditary clique-Helly self-clique graphs. Discret. Appl. Math. 156(7): 1157-1167 (2008) - [j18]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Equivariant collapses and the homotopy type of iterated clique graphs. Discret. Math. 308(15): 3199-3207 (2008) - [j17]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Contractibility and the clique graph operator. Discret. Math. 308(16): 3461-3469 (2008) - [j16]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Posets, clique graphs and their homotopy type. Eur. J. Comb. 29(1): 334-342 (2008) - [j15]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Iterated Clique Graphs and Contractibility. Electron. Notes Discret. Math. 30: 267-271 (2008) - [j14]Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Random Graphs, Retractions and Clique Graphs. Electron. Notes Discret. Math. 30: 285-290 (2008) - 2006
- [j13]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Graph relations, clique divergence and surface triangulations. J. Graph Theory 51(2): 110-122 (2006) - 2005
- [j12]Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Local cutpoints and iterated clique graphs. Electron. Notes Discret. Math. 19: 345-349 (2005) - [j11]Francisco Larrión, Miguel A. Pizaña:
On hereditary Helly self-clique graphs. Electron. Notes Discret. Math. 19: 351-356 (2005) - 2004
- [j10]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique divergent clockwork graphs and partial orders. Discret. Appl. Math. 141(1-3): 195-207 (2004) - [j9]Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña:
The clique operator on cographs and serial graphs. Discret. Math. 282(1-3): 183-191 (2004) - [j8]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter:
A hierarchy of self-clique graphs. Discret. Math. 282(1-3): 193-208 (2004) - 2002
- [b1]Francisco Larrión:
Algebras forestales. UNAM, Mexico, 2002 - [j7]Francisco Larrión, Victor Neumann-Lara:
On clique divergent graphs with linear growth. Discret. Math. 245(1-3): 139-153 (2002) - [j6]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Whitney triangulations, local girth and iterated clique graphs. Discret. Math. 258(1-3): 123-135 (2002) - 2001
- [j5]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique Divergent Clockwork Graphs and Partial Orders. Electron. Notes Discret. Math. 7: 10-13 (2001) - [j4]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
On the homotopy type of the clique graph. J. Braz. Comput. Soc. 7(3): 69-73 (2001) - 2000
- [j3]Francisco Larrión, Victor Neumann-Lara:
Locally C6 graphs are clique divergent. Discret. Math. 215: 159-170 (2000)
1990 – 1999
- 1999
- [j2]Francisco Larrión, Victor Neumann-Lara:
Clique divergent graphs with unbounded sequence of diameters. Discret. Math. 197-198: 491-501 (1999) - 1997
- [j1]Francisco Larrión, Victor Neumann-Lara:
A Family of Clique Divergent Graphs with Linear Growth. Graphs Comb. 13(3): 263-266 (1997)
Coauthor Index
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-07-11 20:16 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:
