The following pages link to Matt DeVos (Q273177):
Displaying 50 items.
- Packing Steiner trees (Q273179) (← links)
- A new proof of Seymour's 6-flow theorem (Q345081) (← links)
- Integral Cayley multigraphs over abelian and Hamiltonian groups (Q396792) (← links)
- A note on forbidding clique immersions (Q396901) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Immersing complete digraphs (Q427820) (← links)
- Forbidden minors for graphs with no first obstruction to parametric Feynman integration (Q482194) (← links)
- Period preserving properties of an invariant from the permanent of signed incidence matrices (Q509907) (← links)
- An Eberhard-like theorem for pentagons and heptagons (Q603874) (← links)
- Unexpected behaviour of crossing sequences (Q651034) (← links)
- On excluded minors of connectivity 2 for the class of frame matroids (Q730264) (← links)
- 3-flows with large support (Q777476) (← links)
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity (Q817746) (← links)
- Graphical representations of graphic frame matroids (Q897266) (← links)
- Locally planar graphs are 5-choosable (Q958683) (← links)
- Cayley sum graphs and eigenvalues of \((3,6)\)-fullerenes (Q1003838) (← links)
- A generalization of Kneser's addition theorem (Q1007230) (← links)
- Extending partial 3-colourings in a planar graph (Q1400956) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- Highly arc-transitive digraphs -- structure and counterexamples (Q1677569) (← links)
- Evolutionarily distinctive species often capture more phylogenetic diversity than expected (Q1794355) (← links)
- Excluding any graph as a minor allows a low tree-width 2-coloring (Q1826951) (← links)
- Matrix choosability (Q1976325) (← links)
- Non-monochromatic triangles in a 2-edge-coloured graph (Q2001990) (← links)
- Flows on flow-admissible signed graphs (Q2033920) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- Branch-depth: generalizing tree-depth of graphs (Q2225398) (← links)
- When does a biased graph come from a group labelling? (Q2406538) (← links)
- Almost balanced biased graph representations of frame matroids (Q2412996) (← links)
- A note on counting flows in signed graphs (Q2420566) (← links)
- Computing quadratic entropy in evolutionary trees (Q2429024) (← links)
- (Q2830347) (← links)
- Finding one tight cycle (Q2930343) (← links)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- Immersing small complete graphs (Q3085021) (← links)
- Rainbow triangles and the Caccetta‐Häggkvist conjecture (Q3299210) (← links)
- (Q3418607) (← links)
- (Q3424774) (← links)
- An analogue of the Descartes-Euler formula for infinite graphs and Higuchi’s conjecture (Q3431215) (← links)
- Small separations in vertex-transitive graphs (Q3439431) (← links)
- Circular Coloring the Plane (Q3503228) (← links)
- (Q3579489) (← links)
- Whitney's Theorem for 2-Regular Planar Digraphs (Q4595181) (← links)
- Average Degree in Graph Powers (Q4908821) (← links)
- Packing Triangles in Weighted Graphs (Q4979838) (← links)
- A rainbow version of Mantel's Theorem (Q5126753) (← links)
- A New Proof of Kemperman's Theorem (Q5262031) (← links)
- A Short Proof of Kneser’s Addition Theorem for Abelian Groups (Q5265386) (← links)
- Unexpected behaviour of crossing sequences (Q5301020) (← links)
- A quadratic lower bound for subset sums (Q5310183) (← links)
