Matt DeVos

Danielle Rogers

Alexandra Wesolek

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

2021

The structure of graphs with no W4 immersion.

[BibT_eX]

[DOI]

Mahdieh Malekian

J. Graph Theory, 2021

The structure of graphs with no K 3 , 3 immersion.

[BibT_eX]

[DOI]

Mahdieh Malekian

J. Graph Theory, 2021

Short rainbow cycles in graphs and matroids.

[BibT_eX]

[DOI]

Matthew Drescher

Sebastián González Hermosillo de la Maza

J. Graph Theory, 2021

Flows on flow-admissible signed graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

2020

3-Flows with large support.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Which Graphs Occur as γ-Graphs?

[BibT_eX]

[DOI]

Graphs Comb., 2020

Branch-depth: Generalizing tree-depth of graphs.

[BibT_eX]

[DOI]

O-joung Kwon

Sang-il Oum

Eur. J. Comb., 2020

2019

Rainbow triangles and the Caccetta-Häggkvist conjecture.

[BibT_eX]

[DOI]

Ron Aharoni

Ron Holzman

J. Graph Theory, 2019

A Note on Counting Flows in Signed Graphs.

[BibT_eX]

[DOI]

Edita Rollová

Electron. J. Comb., 2019

Non-Monochromatic Triangles in a 2-Edge-Coloured Graph.

[BibT_eX]

[DOI]

Jessica McDonald

Amanda Montejano

Electron. J. Comb., 2019

2018

A Maximum Linear Arrangement Problem on Directed Graphs.

[BibT_eX]

[DOI]

Kathryn Nurse

CoRR, 2018

Short rainbow cycles in sparse graphs.

[BibT_eX]

[DOI]

Sebastián González Hermosillo de la Maza

CoRR, 2018

Almost balanced biased graph representations of frame matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

2017

A new proof of Seymour's 6-flow theorem.

[BibT_eX]

[DOI]

Edita Rollová

J. Comb. Theory B, 2017

On excluded minors of connectivity 2 for the class of frame matroids.

[BibT_eX]

[DOI]

Irene Pivotto

Eur. J. Comb., 2017

Whitney's theorem for 2-regular planar digraphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2017

2016

Packing Steiner trees.

[BibT_eX]

[DOI]

Jessica McDonald

Irene Pivotto

J. Comb. Theory B, 2016

On a Generalization of the Cauchy-Davenport Theorem.

[BibT_eX]

[DOI]

Integers, 2016

2015

New Proof of Kemperman's Theorem.

[BibT_eX]

[DOI]

Tomas Boothby

Amanda Montejano

Integers, 2015

Graphical Representations of Graphic Frame Matroids.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Forbidden minors for graphs with no first obstruction to parametric Feynman integration.

[BibT_eX]

[DOI]

Discret. Math., 2015

Highly arc-transitive digraphs - Structure and counterexamples.

[BibT_eX]

[DOI]

Comb., 2015

2014

Packing Triangles in Weighted Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

A minimum degree condition forcing complete graph immersion.

[BibT_eX]

[DOI]

Comb., 2014

When does a biased graph come from a group labelling?

[BibT_eX]

[DOI]

Irene Pivotto

Adv. Appl. Math., 2014

2013

Average Degree in Graph Powers.

[BibT_eX]

[DOI]

Jessica McDonald

Diego Scheide

J. Graph Theory, 2013

A Note on Forbidding Clique Immersions.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Integral Cayley Multigraphs over Abelian and Hamiltonian Groups.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Immersing complete digraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

2011

High-girth cubic graphs are homomorphic to the Clebsch graph.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

Unexpected behaviour of crossing sequences.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2011

Computing quadratic entropy in evolutionary trees.

[BibT_eX]

[DOI]

Comput. Math. Appl., 2011

2010

Finding one tight cycle.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2010

An Eberhard-Like Theorem for Pentagons and Heptagons.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Discret. Comput. Geom., 2010

Edge Growth in Graph Cubes

[BibT_eX]

[DOI]

Stéphan Thomassé

CoRR, 2010

Immersing small complete graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

Haruko Okamura

Ars Math. Contemp., 2010

2009

Cayley sum graphs and eigenvalues of (3, 6)-fullerenes.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Simple Affine Extractors using Dimension Expansion.

[BibT_eX]

[DOI]

Ariel Gabizon

Electron. Colloquium Comput. Complex., 2009

2008

Locally planar graphs are 5-choosable.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

J. Comb. Theory B, 2008

5-cycles and the Petersen graph

[BibT_eX]

[DOI]

Vahan V. Mkrtchyan

Samvel S. Petrosyan

CoRR, 2008

2007

Circular Coloring the Plane.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

2006

Expected Case for Projecting Points.

[BibT_eX]

[DOI]

Sergio Cabello

Informatica (Slovenia), 2006

Small separations in vertex-transitive graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

Nowhere-zero Z3-flows through Z3-connectivity.

[BibT_eX]

[DOI]

Rui Xu

Gexin Yu

Discret. Math., 2006

2004

Excluding any graph as a minor allows a low tree-width 2-coloring.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Antisymmetric flows and edge-connectivity.

[BibT_eX]

[DOI]

Jaroslav Nesetril

André Raspaud

Discret. Math., 2004

2003

Extending partial 3-colourings in a planar graph.

[BibT_eX]

[DOI]

Paul D. Seymour

J. Comb. Theory B, 2003

2000

Matrix Choosability.

[BibT_eX]

[DOI]