default search action
Jorge L. Arocha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j18]Jorge L. Arocha, Amanda Montejano
:
Null and non-rainbow colorings of projective plane and sphere triangulations. Discret. Appl. Math. 210: 195-199 (2016) - 2015
- [j17]Jorge L. Arocha, Javier Bracho
Reconstructing surface triangulations by their intersection matrices. Discuss. Math. Graph Theory 35(3): 483-491 (2015) - 2013
- [j16]Amanda Montejano, Jorge L. Arocha:
Null and non-rainbow colorings of maximal planar graphs. Electron. Notes Discret. Math. 44: 121-126 (2013) - 2011
- [j15]Jorge L. Arocha, Javier Bracho
A Helly Type Theorem for Abstract Projective Geometries. Discret. Comput. Geom. 45(2): 223-229 (2011) - [j14]Jorge L. Arocha, Javier Bracho
Transversals to the convex hulls of all k-sets of discrete subsets of Rn. J. Comb. Theory A 118(1): 197-207 (2011) - 2010
- [j13]Jorge L. Arocha, Jesús Jerónimo-Castro, Luis Montejano, Edgardo Roldán-Pensado
On a conjecture of Grünbaum concerning partitions of convex sets. Period. Math. Hung. 60(1): 41-47 (2010)
2000 – 2009
- 2009
- [j12]Jorge L. Arocha, Imre Bárány, Javier Bracho
Very Colorful Theorems. Discret. Comput. Geom. 42(2): 142-154 (2009) - 2008
- [j11]Jorge L. Arocha, Javier Bracho
A colorful theorem on transversal lines to plane convex sets. Comb. 28(4): 379-384 (2008) - 2007
- [j10]Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees. J. Graph Theory 54(2): 103-114 (2007) - 2005
- [j9]Jorge L. Arocha, Javier Bracho
Configurations of Flats, I: Manifolds of Points in the Projective Line. Discret. Comput. Geom. 34(1): 111-128 (2005) - 2003
- [j8]Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees: cases 0 and 1 mod 12. Discuss. Math. Graph Theory 23(1): 177-187 (2003) - 2002
- [j7]Jorge L. Arocha, Javier Bracho
Separoids, Their Categories and a Hadwiger-Type Theorem for Transversals. Discret. Comput. Geom. 27(3): 377-385 (2002) - 2000
- [j6]Jorge L. Arocha, Bernardo Llano:
Mean value for the matching and dominating polynomial. Discuss. Math. Graph Theory 20(1): 57-69 (2000) - [j5]Jorge L. Arocha, Pilar Valencia:
Long induced paths in 3-connected planar graphs. Discuss. Math. Graph Theory 20(1): 105-107 (2000)
1990 – 1999
- 1999
- [j4]Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant
Tightness problems in the plane. Discret. Math. 194(1-3): 1-11 (1999) - [j3]Jorge L. Arocha, Joaquín Tey:
The size of minimum 3-trees: Cases 3 and 4 mod 6. J. Graph Theory 30(3): 157-166 (1999) - 1995
- [j2]Jorge L. Arocha, Javier Bracho
Tight and Untight Triangulations of Surfaces by Complete Graphs. J. Comb. Theory B 63(2): 185-199 (1995) - 1992
- [j1]Jorge L. Arocha, Javier Bracho
On the minimum size of tight hypergraphs. J. Graph Theory 16(4): 319-326 (1992)
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-06-10 20:30 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: