Zobrazeno 1 - 10
of 46
pro vyhledávání: '"Vandenbussche, Jennifer"'
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 $X$. We conjecture that a Hall-type sufficient condition holds based o
Externí odkaz:
http://arxiv.org/abs/2310.05248
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Combin. Optimization, 2018
For a set of nonnegative integers $c_1, \ldots, c_k$, a $(c_1, c_2,\ldots, c_k)$-coloring of a graph $G$ is a partition of $V(G)$ into $V_1, \ldots, V_k$ such that for every $i$, $1\le i\le k, G[V_i]$ has maximum degree at most $c_i$. We prove that a
Externí odkaz:
http://arxiv.org/abs/1806.07511
Autor:
Vandenbussche, Jennifer.
Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2008.
Source: Dissertation Abstracts International, Volume: 69-05, Section: B, page: 3038. Adviser: Alexandr Kostochka. Includes bibliographical references (leaves 97-101) Available on
Source: Dissertation Abstracts International, Volume: 69-05, Section: B, page: 3038. Adviser: Alexandr Kostochka. Includes bibliographical references (leaves 97-101) Available on
Autor:
Cranston, Daniel W., Korula, Nitish, LeSaulnier, Timothy D., Milans, Kevin, Stocker, Christopher, Vandenbussche, Jennifer, West, Douglas B.
Publikováno v:
Journal of Graph Theory. Vol. 70(1), 2012, pp. 10-28
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. The {\it overlap number} $\ol(G)$ (introduced by Rosgen) is the mini
Externí odkaz:
http://arxiv.org/abs/1007.0804
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 bigraph is a bipartite graph in which each vertex of one part has degree 3
Externí odkaz:
http://arxiv.org/abs/0704.2650
Publikováno v:
In Discrete Mathematics 2012 312(5):957-962
Publikováno v:
The American Mathematical Monthly, 2008 Jun 01. 115(6), 568-568.
Externí odkaz:
https://www.jstor.org/stable/27642543
Publikováno v:
Primus: Problems, Resources & Issues in Mathematics Undergraduate Studies; 2021, Vol. 31 Issue 3-5, p330-342, 13p
Autor:
Vandenbussche, Jennifer1 jvandenb@spsu.edu, West, Douglas B.2 west@math.uiuc.edu
Publikováno v:
SIAM Journal on Discrete Mathematics. 2009, Vol. 23 Issue 3, p1539-1547. 9p. 1 Diagram.