default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatt DeVos
Person information
- affiliation: Simon Fraser University, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c3]Matt DeVos, Danielle Rogers, Alexandra Wesolek
:
On Minimizing the Energy of a Spherical Graph Representation. GD (2) 2023: 218-231- [i6]Matt DeVos, Danielle Rogers, Alexandra Wesolek:
On Minimizing the Energy of a Spherical Graph Representation. CoRR abs/2309.02817 (2023) - 2021
- [j44]Matt DeVos, Jiaao Li, You Lu, Rong Luo, Cun-Quan Zhang, Zhang Zhang:
Flows on flow-admissible signed graphs. J. Comb. Theory B 149: 198-221 (2021) - [j43]Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano:
Short rainbow cycles in graphs and matroids. J. Graph Theory 96(2): 192-202 (2021) - [j42]Matt DeVos, Mahdieh Malekian:
The structure of graphs with no W4 immersion. J. Graph Theory 97(4): 657-679 (2021) - [j41]Matt DeVos, Mahdieh Malekian:
The structure of graphs with no K 3 , 3 immersion. J. Graph Theory 98(1): 5-23 (2021) - 2020
- [j40]Matt DeVos, O-joung Kwon, Sang-il Oum:
Branch-depth: Generalizing tree-depth of graphs. Eur. J. Comb. 90: 103186 (2020) - [j39]Matt DeVos, Adam Dyck, Jonathan Jedwab, Samuel Simon:
Which Graphs Occur as γ-Graphs? Graphs Comb. 36(4): 1219-1246 (2020) - [j38]Matt DeVos, Jessica McDonald, Irene Pivotto, Edita Rollová, Robert Sámal:
3-Flows with large support. J. Comb. Theory B 144: 32-80 (2020)
2010 – 2019
- 2019
- [j37]Matt DeVos, Edita Rollová, Robert Sámal:
A Note on Counting Flows in Signed Graphs. Electron. J. Comb. 26(2): 2 (2019) - [j36]Matt DeVos, Jessica McDonald, Amanda Montejano:
Non-Monochromatic Triangles in a 2-Edge-Coloured Graph. Electron. J. Comb. 26(3): 3 (2019) - [j35]Ron Aharoni, Matt DeVos, Ron Holzman:
Rainbow triangles and the Caccetta-Häggkvist conjecture. J. Graph Theory 92(4): 347-360 (2019) - 2018
- [j34]Matt DeVos, Daryl Funk:
Almost balanced biased graph representations of frame matroids. Adv. Appl. Math. 96: 139-175 (2018) - [i5]Matt DeVos, Sebastián González Hermosillo de la Maza, Krystal Guo, Daryl Funk, Tony Huynh, Bojan Mohar, Amanda Montejano:
Short rainbow cycles in sparse graphs. CoRR abs/1806.00825 (2018) - [i4]Matt DeVos, Kathryn Nurse:
A Maximum Linear Arrangement Problem on Directed Graphs. CoRR abs/1810.12277 (2018) - 2017
- [j33]Dan Archdeacon, Matt DeVos, Stefan Hannie, Bojan Mohar:
Whitney's theorem for 2-regular planar digraphs. Australas. J Comb. 67: 159-165 (2017) - [j32]Matt DeVos, Daryl Funk, Irene Pivotto:
On excluded minors of connectivity 2 for the class of frame matroids. Eur. J. Comb. 61: 167-196 (2017) - [j31]Matt DeVos, Edita Rollová, Robert Sámal:
A new proof of Seymour's 6-flow theorem. J. Comb. Theory B 122: 187-195 (2017) - 2016
- [j30]Matt DeVos:
On a Generalization of the Cauchy-Davenport Theorem. Integers 16: A7 (2016) - [j29]Matt DeVos, Jessica McDonald, Irene Pivotto:
Packing Steiner trees. J. Comb. Theory B 119: 178-213 (2016) - 2015
- [j28]Matt DeVos, Bojan Mohar, Robert Sámal:
Highly arc-transitive digraphs - Structure and counterexamples. Comb. 35(5): 553-571 (2015) - [j27]Samson Black, Iain Crump, Matt DeVos, Karen A. Yeats:
Forbidden minors for graphs with no first obstruction to parametric Feynman integration. Discret. Math. 338(3): 9-35 (2015) - [j26]Rong Chen, Matt DeVos, Daryl Funk, Irene Pivotto:
Graphical Representations of Graphic Frame Matroids. Graphs Comb. 31(6): 2075-2086 (2015) - [j25]Tomas Boothby, Matt DeVos, Amanda Montejano:
New Proof of Kemperman's Theorem. Integers 15: A15 (2015) - 2014
- [j24]Matt DeVos, Daryl Funk, Irene Pivotto:
When does a biased graph come from a group labelling? Adv. Appl. Math. 61: 1-18 (2014) - [j23]Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. Comb. 34(3): 279-298 (2014) - [j22]Guillaume Chapuy, Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Packing Triangles in Weighted Graphs. SIAM J. Discret. Math. 28(1): 226-239 (2014) - 2013
- [j21]Matt DeVos, Roi Krakovski, Bojan Mohar, Azhvan Sheikh Ahmady:
Integral Cayley Multigraphs over Abelian and Hamiltonian Groups. Electron. J. Comb. 20(2): 63 (2013) - [j20]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
A Note on Forbidding Clique Immersions. Electron. J. Comb. 20(3): 55 (2013) - [j19]Matt DeVos, Jessica McDonald, Diego Scheide:
Average Degree in Graph Powers. J. Graph Theory 72(1): 7-18 (2013) - 2012
- [j18]Matt DeVos, Jessica McDonald, Bojan Mohar, Diego Scheide:
Immersing complete digraphs. Eur. J. Comb. 33(6): 1294-1302 (2012) - 2011
- [j17]Drago Bokal, Matt DeVos, Sandi Klavzar, Aki Mimoto, Arne Ø. Mooers:
Computing quadratic entropy in evolutionary trees. Comput. Math. Appl. 62(10): 3821-3828 (2011) - [j16]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. J. Comb. Theory B 101(6): 448-463 (2011) - [j15]Matt DeVos, Robert Sámal:
High-girth cubic graphs are homomorphic to the Clebsch graph. J. Graph Theory 66(3): 241-259 (2011) - 2010
- [j14]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar, Haruko Okamura:
Immersing small complete graphs. Ars Math. Contemp. 3(2): 139-146 (2010) - [j13]Matt DeVos, Agelos Georgakopoulos, Bojan Mohar, Robert Sámal:
An Eberhard-Like Theorem for Pentagons and Heptagons. Discret. Comput. Geom. 44(4): 931-945 (2010) - [j12]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. ACM Trans. Algorithms 6(4): 61:1-61:13 (2010) - [c2]Matt DeVos, Ariel Gabizon:
Simple Affine Extractors Using Dimension Expansion. CCC 2010: 50-57 - [i3]Matt DeVos, Stéphan Thomassé:
Edge Growth in Graph Cubes. CoRR abs/1009.0343 (2010)
2000 – 2009
- 2009
- [j11]Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. J. Comb. Theory B 99(2): 358-369 (2009) - [i2]Matt DeVos, Ariel Gabizon:
Simple Affine Extractors using Dimension Expansion. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j10]Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. Electron. Notes Discret. Math. 31: 259-264 (2008) - [j9]Matt DeVos, Ken-ichi Kawarabayashi, Bojan Mohar:
Locally planar graphs are 5-choosable. J. Comb. Theory B 98(6): 1215-1232 (2008) - [c1]Sergio Cabello, Matt DeVos, Jeff Erickson, Bojan Mohar:
Finding one tight cycle. SODA 2008: 527-531 - [i1]Matt DeVos, Vahan V. Mkrtchyan, Samvel S. Petrosyan:
5-cycles and the Petersen graph. CoRR abs/0801.3714 (2008) - 2007
- [j8]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007) - 2006
- [j7]Matt DeVos, Rui Xu, Gexin Yu:
Nowhere-zero Z3-flows through Z3-connectivity. Discret. Math. 306(1): 26-30 (2006) - [j6]Matt DeVos, Bojan Mohar:
Small separations in vertex-transitive graphs. Electron. Notes Discret. Math. 24: 165-172 (2006) - [j5]Sergio Cabello, Matt DeVos, Bojan Mohar:
Expected Case for Projecting Points. Informatica (Slovenia) 30(3): 289-293 (2006) - 2004
- [j4]Matt DeVos, Jaroslav Nesetril, André Raspaud:
Antisymmetric flows and edge-connectivity. Discret. Math. 276(1-3): 161-167 (2004) - [j3]Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan:
Excluding any graph as a minor allows a low tree-width 2-coloring. J. Comb. Theory B 91(1): 25-41 (2004) - 2003
- [j2]Matt DeVos, Paul D. Seymour:
Extending partial 3-colourings in a planar graph. J. Comb. Theory B 88(2): 219-225 (2003) - 2000
- [j1]Matt DeVos:
Matrix Choosability. J. Comb. Theory A 90(1): 197-209 (2000)
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-24 20:46 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:
