default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManoel Lemos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j50]Manoel Lemos, James G. Oxley:
An Upper Bound for the Circumference of a 3-Connected Binary Matroid. Electron. J. Comb. 30(1) (2023)- [j49]Manoel Lemos:
On matroids with the same connectivity function. Discret. Math. 346(12): 113587 (2023) - 2022
- [j48]Manoel Lemos:
A matroid operation that commutes with duality. Discret. Math. 345(6): 112854 (2022) - 2020
- [j47]Manoel Lemos:
Matroids with a unique non-common circuit containing a fixed element. Discret. Math. 343(9): 111954 (2020)
2010 – 2019
- 2018
- [j46]Manoel Lemos:
Improving a chain theorem for triangle-free 3-connected matroids. Eur. J. Comb. 69: 91-106 (2018) - 2016
- [j45]Antonio José Ferreira Gomes Jr., Manoel Lemos:
The number of elements belonging to triads in 3-connected binary matroids. Discret. Math. 339(1): 255-262 (2016) - 2015
- [j44]Manoel Lemos, Maria Isabelle Silva:
On chains of matroids in the weak order. Eur. J. Comb. 50: 152-158 (2015) - 2014
- [j43]Sandra R. Kingan, Manoel Lemos:
A Decomposition Theorem for Binary Matroids with no Prism Minor. Graphs Comb. 30(6): 1479-1497 (2014) - 2013
- [j42]Manoel Lemos:
On triangle-free 3-connected matroids. Adv. Appl. Math. 50(1): 75-114 (2013) - 2012
- [j41]Manoel Lemos:
On matroids with few circuits containing a pair of elements. Discret. Math. 312(7): 1309-1313 (2012) - [j40]Sandra R. Kingan, Manoel Lemos:
Matroids with at least two regular elements. Eur. J. Comb. 33(6): 1022-1029 (2012) - 2011
- [j39]Hong-Jian Lai, Manoel Lemos, Talmage James Reid, Yehong Shao, Haidong Wu:
Obstructions to a binary matroid being graphic. Eur. J. Comb. 32(6): 853-860 (2011) - [j38]Manoel Lemos, Talmage James Reid, Haidong Wu:
On the circuit-spectrum of binary matroids. Eur. J. Comb. 32(6): 861-869 (2011) - 2010
- [j37]Raul Cordovil, Manoel Lemos:
The 3-connected matroids with circumference 6. Discret. Math. 310(8): 1354-1365 (2010) - [j36]Manoel Lemos, Talmage James Reid, Haidong Wu:
Characterizing 3-connected planar graphs and graphic matroids. J. Graph Theory 64(2): 165-174 (2010)
2000 – 2009
- 2009
- [j35]Manoel Lemos:
A characterization of graphic matroids using non-separating cocircuits. Adv. Appl. Math. 42(1): 75-81 (2009) - [j34]Raul Cordovil, Braulio Maia Jr., Manoel Lemos:
Removing circuits in 3-connected binary matroids. Discret. Math. 309(4): 655-665 (2009) - [j33]Raul Cordovil, Braulio Maia Jr., Manoel Lemos:
The 3-connected binary matroids with circumference 6 or 7. Eur. J. Comb. 30(8): 1810-1824 (2009) - 2008
- [j32]Manoel Lemos, T. R. B. Melo:
Non-separating cocircuits in matroids. Discret. Appl. Math. 156(7): 1019-1024 (2008) - [j31]Manoel Lemos:
Relations between the Circumference and e -Circumference of a Matroid. Graphs Comb. 24(2): 101-105 (2008) - 2007
- [j30]Manoel Lemos:
On the number of triangles in 3-connected matroids. Eur. J. Comb. 28(3): 931-941 (2007) - 2006
- [j29]Manoel Lemos:
Matroids with few non-common bases. Discret. Math. 306(7): 680-687 (2006) - [j28]Manoel Lemos:
Elements belonging to triangles in 3-connected matroids. Discret. Math. 306(21): 2790-2797 (2006) - [j27]Manoel Lemos:
Weight Distribution of the Bases of a Matroid. Graphs Comb. 22(1): 69-82 (2006) - [j26]Sandra R. Kingan, Manoel Lemos:
On the Circuit-cocircuit Intersection Conjecture. Graphs Comb. 22(4): 471-480 (2006) - [j25]Manoel Lemos, James G. Oxley:
Matroid packing and covering with circuits through an element. J. Comb. Theory B 96(1): 135-158 (2006) - 2005
- [j24]Manoel Lemos, T. R. B. Melo:
Non-separating cocircuits in matroids. Electron. Notes Discret. Math. 19: 149-153 (2005) - 2004
- [j23]Manoel Lemos:
On the number of non-isomorphic matroids. Adv. Appl. Math. 33(4): 733-746 (2004) - [j22]Manoel Lemos, James G. Oxley:
On the minor-minimal 2-connected graphs having a fixed minor. Discret. Math. 280(1-3): 77-118 (2004) - [j21]Manoel Lemos:
Elements belonging to triads in 3-connected matroids. Discret. Math. 285(1-3): 167-181 (2004) - 2003
- [j20]Manoel Lemos:
Uniqueness of the decomposition of the rank function of a 2-polymatroid. Discret. Math. 269(1-3): 161-179 (2003) - [j19]Manoel Lemos:
Matroids with many common bases. Discret. Math. 270(1-3): 192-204 (2003) - [j18]Manoel Lemos, James G. Oxley:
On the minor-minimal 3-connected matroids having a fixed minor. Eur. J. Comb. 24(8): 1097-1123 (2003) - [j17]Manoel Lemos, James G. Oxley:
On removable cycles through every edge. J. Graph Theory 42(2): 155-164 (2003) - 2002
- [j16]Sandra R. Kingan, Manoel Lemos:
Almost-Graphic Matroids. Adv. Appl. Math. 28(3-4): 438-477 (2002) - [j15]Manoel Lemos:
On the Connectivity Function of a Binary Matroid. J. Comb. Theory B 86(1): 114-132 (2002) - 2001
- [j14]Braulio Maia Jr., Manoel Lemos:
Matroids Having Small Circumference. Comb. Probab. Comput. 10(4): 349-360 (2001) - [j13]Manoel Lemos:
On Mills's conjecture on matroids with many common bases. Discret. Math. 240(1-3): 271-276 (2001) - 2000
- [j12]Manoel Lemos, James G. Oxley:
On the 3-connected matroids that are minimal having a fixed spanning restriction. Discret. Math. 218(1-3): 131-165 (2000) - [j11]Manoel Lemos, Sérgio Mota:
The reconstruction of a matroid from its connectivity function. Discret. Math. 220(1-3): 131-143 (2000) - [j10]Manoel Lemos, James G. Oxley:
On size, circumference and circuit removal in 3-connected matroids. Discret. Math. 220(1-3): 145-157 (2000) - [j9]Manoel Lemos, James G. Oxley, Talmage James Reid:
On the 3-Connected Matroids That are Minimal Having a Fixed Restriction. Graphs Comb. 16(3): 285-318 (2000)
1990 – 1999
- 1999
- [j8]Manoel Lemos, James G. Oxley:
On removable circuits in graphs and matroids. J. Graph Theory 30(1): 51-66 (1999) - 1998
- [j7]Manoel Lemos, James G. Oxley:
On packing minors into connected matroids. Discret. Math. 189(1-3): 283-289 (1998) - 1997
- [j6]Manoel Lemos:
Non-binary matroids having four non-binary elements. Ars Comb. 46 (1997) - 1994
- [j5]Manoel Lemos:
Non-Binary Madroids Having At Most Three Non-Binary Elements. Comb. Probab. Comput. 3: 355-369 (1994) - [j4]Manoel Lemos:
Matroids having the same connectivity function. Discret. Math. 131(1-3): 153-161 (1994) - 1991
- [j3]Manoel Lemos:
K-Elimination property for circuits of matroids. J. Comb. Theory B 51(2): 211-226 (1991)
1980 – 1989
- 1989
- [j2]Manoel Lemos:
On 3-connected matroids. Discret. Math. 73(3): 273-283 (1989) - 1988
- [j1]Manoel Lemos:
An extension of Lindström's result about characteristic sets of matroids. Discret. Math. 68(1): 85-101 (1988)
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 2025-01-21 00:12 CET 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:
