Jennifer Vandenbussche

activity

20072025

collaborators

6 papers

math.CO2025

Strong binding numbers and factors

Guantao Chen, Mikhail Lavrov, Yuying Ma +2

Let $G$ be a simple graph. The $k$ -th neighborhood of a vertex subset $S \subseteq V (G)$ , denoted $Λ^{k} (S)$ , is the set of vertices that are adjacent to at least $k$ vertices in $S$ …

math.CO2025

Bipartite graphs with the double Hall property

Guantao Chen, Mikhail Lavrov, Yuying Ma +2

The super-neighborhood of a vertex set $A$ in a graph $G$ , denoted by $Λ^{2} (A)$ , is the set of vertices adjacent to at least two vertices in $A$ . We say that a bipartite graph $G=(X…

math.CO2023

A Hall-type condition for path covers in bipartite graphs

Mikhail Lavrov, Jennifer Vandenbussche

Let $G$ be a bipartite graph with bipartition $(X, Y)$ . Inspired by a hypergraph problem, we seek an upper bound on the number of disjoint paths needed to cover all the vertices of…

math.CO2018

Planar graphs without 4-cycles and close triangles are (2,0,0)-colorable

Heather Hoskins, Runrun Liu, Jennifer Vandenbussche +1

For a set of nonnegative integers $c_{1}, \dots, c_{k}$ , a $(c_{1}, c_{2}, \dots, c_{k})$ -coloring of a graph $G$ is a partition of $V (G)$ into $V_{1}, \dots, V_{k}$ such that for every $i$ , $…

math.CO2010

Overlap Number of Graphs

Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier +4

An {\it overlap representation} of a graph $G$ assigns sets to vertices so that vertices are adjacent if and only if their assigned sets intersect with neither containing the other…

math.CO2007

Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs

Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche +1

An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigr…