default search action
Sean McGuinness
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j35]Sean McGuinness
:
Serial exchanges in random bases. Discret. Appl. Math. 361: 103-110 (2025) - 2024
- [j34]Sean McGuinness
Rota's basis conjecture for matroids with density close to one. Adv. Appl. Math. 152: 102593 (2024) - [j33]Sean McGuinness:
Cyclic Orderings of Paving Matroids. Electron. J. Comb. 31(4) (2024) - 2023
- [j32]Benjamin Friedman, Sean McGuinness
Girth Conditions and Rota's Basis Conjecture. Graphs Comb. 39(3): 51 (2023) - 2022
- [j31]Sean McGuinness:
Serial exchanges in matroids. Discret. Math. 345(2): 112679 (2022) - 2020
- [j30]Sean McGuinness:
Frame matroids, toric ideals, and a conjecture of White. Adv. Appl. Math. 118: 102042 (2020)
2010 – 2019
- 2019
- [j29]Benjamin Friedman, Sean McGuinness:
The Alon-Tarsi conjecture: A perspective on the main results. Discret. Math. 342(8): 2234-2253 (2019) - 2016
- [j28]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore
A dichotomy theorem for circular colouring reconfiguration. Theor. Comput. Sci. 639: 1-13 (2016) - [c1]Lin Zhu, Hesen Liu, Yiwei Ma, Yilu Liu, Evangelos Farantatos, Mahendra Patel, Sean McGuinness:
Adaptive and coordinated oscillation damping control using measurement-driven approach. PSCC 2016: 1-7 - 2015
- [i1]Richard C. Brewster, Sean McGuinness, Benjamin R. Moore, Jonathan A. Noel:
A Dichotomy Theorem for Circular Colouring Reconfiguration. CoRR abs/1508.05573 (2015) - 2014
- [j27]Sean McGuinness:
Dominating circuits in regular matroids. Adv. Appl. Math. 53: 72-111 (2014) - [j26]Sean McGuinness:
Binary matroids with no 4-spike minors. Discret. Math. 324: 72-77 (2014) - [j25]Sean McGuinness:
A base exchange property for regular matroids. J. Comb. Theory B 107: 42-77 (2014) - [j24]Peter Harding, Sean McGuinness:
Gallai's Conjecture For Graphs of Girth at Least Four. J. Graph Theory 75(3): 256-274 (2014) - 2013
- [j23]Richard C. Brewster, Sean McGuinness, Morten Hegner Nielsen:
Factors with Multiple Degree Constraints in Graphs. SIAM J. Discret. Math. 27(4): 1734-1747 (2013) - 2010
- [j22]Sean McGuinness:
Circuit and fractional circuit covers of matroids. Eur. J. Comb. 31(5): 1335-1341 (2010) - [j21]Sean McGuinness:
A conjecture of Welsh revisited. Eur. J. Comb. 31(8): 2120-2129 (2010) - [j20]Sean McGuinness:
Cycle and cocycle coverings of graphs. J. Graph Theory 65(4): 270-284 (2010)
2000 – 2009
- 2009
- [j19]Sean McGuinness:
Ore-type and Dirac-type theorems for matroids. J. Comb. Theory B 99(6): 827-842 (2009) - 2007
- [j18]Scott Jones, Sean McGuinness:
Defining matroids through sequential selection. Eur. J. Comb. 28(1): 469-480 (2007) - 2005
- [j17]Sean McGuinness:
Bonds Intersecting Cycles In A Graph. Comb. 25(4): 439-450 (2005) - [j16]Sean McGuinness:
Circuits Through Cocircuits In A Graph With Extensions To Matroids. Comb. 25(4): 451-463 (2005) - [j15]Sean McGuinness:
Contractible bonds in graphs. J. Comb. Theory B 93(2): 207-249 (2005) - [j14]Roland Häggkvist, Sean McGuinness:
Double covers of cubic graphs with oddness 4. J. Comb. Theory B 93(2): 251-277 (2005) - 2003
- [j13]Jan van den Heuvel
Coloring the square of a planar graph. J. Graph Theory 42(2): 110-124 (2003) - 2001
- [j12]Sean McGuinness:
Colouring Arcwise Connected Sets in the Plane II. Graphs Comb. 17(1): 135-148 (2001) - 2000
- [j11]Sean McGuinness:
Contractible bonds in Graphs. Electron. Notes Discret. Math. 5: 225-227 (2000) - [j10]Sean McGuinness:
Colouring Arcwise Connected Sets in the Plane I. Graphs Comb. 16(4): 429-439 (2000) - [j9]Sean McGuinness:
On decomposing a graph into nontrivial bonds. J. Graph Theory 35(2): 109-127 (2000)
1990 – 1999
- 1997
- [j8]Luis A. Goddyn, Jan van den Heuvel, Sean McGuinness:
Removable Circuits in Multigraphs. J. Comb. Theory B 71(2): 130-143 (1997) - 1996
- [j7]Sean McGuinness:
On bounding the chromatic number of L-graphs. Discret. Math. 154(1-3): 179-187 (1996) - 1995
- [j6]Sean McGuinness:
Greedy clique decompositions and the Turán numbers. Eur. J. Comb. 16(4): 371-380 (1995) - 1994
- [j5]Sean McGuinness:
Restricted Greedy Clique Decompositions and Greedy Clique Decompositions of K4-Free Graphs. Comb. 14(3): 321-334 (1994) - [j4]Sean McGuinness:
Greedy Maximum-Clique Decompositions. Comb. 14(3): 335-343 (1994) - [j3]Sean McGuinness:
The greedy clique decomposition of a graph. J. Graph Theory 18(4): 427-430 (1994) - 1990
- [j2]Sean McGuinness, Rolf S. Rees:
On the number of distinct minimal clique partitions and clique covers of a line graph. Discret. Math. 83(1): 49-62 (1990)
1980 – 1989
- 1986
- [j1]David A. Gregory, Sean McGuinness, Walter D. Wallis:
Clique partitions of the cocktail party graph. Discret. Math. 59(3): 267-273 (1986)
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-09 13:17 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: