Matt DeVos

Affiliations:
  • Simon Fraser University, Department of Mathematics


According to our database1, Matt DeVos authored at least 49 papers between 2000 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On Minimizing the Energy of a Spherical Graph Representation.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2021
The structure of graphs with no W<sub>4</sub> immersion.
J. Graph Theory, 2021

The structure of graphs with no K 3 , 3 immersion.
J. Graph Theory, 2021

Short rainbow cycles in graphs and matroids.
J. Graph Theory, 2021

Flows on flow-admissible signed graphs.
J. Comb. Theory B, 2021

2020
3-Flows with large support.
J. Comb. Theory B, 2020

Which Graphs Occur as γ-Graphs?
Graphs Comb., 2020

Branch-depth: Generalizing tree-depth of graphs.
Eur. J. Comb., 2020

2019
Rainbow triangles and the Caccetta-Häggkvist conjecture.
J. Graph Theory, 2019

A Note on Counting Flows in Signed Graphs.
Electron. J. Comb., 2019

Non-Monochromatic Triangles in a 2-Edge-Coloured Graph.
Electron. J. Comb., 2019

2018
A Maximum Linear Arrangement Problem on Directed Graphs.
CoRR, 2018

Short rainbow cycles in sparse graphs.
CoRR, 2018

Almost balanced biased graph representations of frame matroids.
Adv. Appl. Math., 2018

2017
A new proof of Seymour's 6-flow theorem.
J. Comb. Theory B, 2017

On excluded minors of connectivity 2 for the class of frame matroids.
Eur. J. Comb., 2017

Whitney's theorem for 2-regular planar digraphs.
Australas. J Comb., 2017

2016
Packing Steiner trees.
J. Comb. Theory B, 2016

On a Generalization of the Cauchy-Davenport Theorem.
Integers, 2016

2015
New Proof of Kemperman's Theorem.
Integers, 2015

Graphical Representations of Graphic Frame Matroids.
Graphs Comb., 2015

Forbidden minors for graphs with no first obstruction to parametric Feynman integration.
Discret. Math., 2015

Highly arc-transitive digraphs - Structure and counterexamples.
Comb., 2015

2014
Packing Triangles in Weighted Graphs.
SIAM J. Discret. Math., 2014

A minimum degree condition forcing complete graph immersion.
Comb., 2014

When does a biased graph come from a group labelling?
Adv. Appl. Math., 2014

2013
Average Degree in Graph Powers.
J. Graph Theory, 2013

A Note on Forbidding Clique Immersions.
Electron. J. Comb., 2013

Integral Cayley Multigraphs over Abelian and Hamiltonian Groups.
Electron. J. Comb., 2013

2012
Immersing complete digraphs.
Eur. J. Comb., 2012

2011
High-girth cubic graphs are homomorphic to the Clebsch graph.
J. Graph Theory, 2011

Unexpected behaviour of crossing sequences.
J. Comb. Theory B, 2011

Computing quadratic entropy in evolutionary trees.
Comput. Math. Appl., 2011

2010
Finding one tight cycle.
ACM Trans. Algorithms, 2010

An Eberhard-Like Theorem for Pentagons and Heptagons.
Discret. Comput. Geom., 2010

Edge Growth in Graph Cubes
CoRR, 2010

Immersing small complete graphs.
Ars Math. Contemp., 2010

2009
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.
J. Comb. Theory B, 2009

Simple Affine Extractors using Dimension Expansion.
Electron. Colloquium Comput. Complex., 2009

2008
Locally planar graphs are 5-choosable.
J. Comb. Theory B, 2008

5-cycles and the Petersen graph
CoRR, 2008

2007
Circular Coloring the Plane.
SIAM J. Discret. Math., 2007

2006
Expected Case for Projecting Points.
Informatica (Slovenia), 2006

Small separations in vertex-transitive graphs.
Electron. Notes Discret. Math., 2006

Nowhere-zero <i>Z</i><sub>3</sub>-flows through <i>Z</i><sub>3</sub>-connectivity.
Discret. Math., 2006

2004
Excluding any graph as a minor allows a low tree-width 2-coloring.
J. Comb. Theory B, 2004

Antisymmetric flows and edge-connectivity.
Discret. Math., 2004

2003
Extending partial 3-colourings in a planar graph.
J. Comb. Theory B, 2003

2000
Matrix Choosability.
J. Comb. Theory A, 2000


  Loading...