Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Jennifer Diemunsch"'
Publikováno v:
Discrete Applied Mathematics. 232:99-106
The robber locating game, introduced by Seager (2012), is a variation of the classic cops and robbers game on a graph. A cop attempts to locate an invisible robber on a graph by probing a single vertex v each turn, from which the cop learns the robbe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1628386859adf238d0539b53b20c6240
https://doi.org/10.1016/j.dam.2017.07.019
https://doi.org/10.1016/j.dam.2017.07.019
Autor:
Elyse Yeager, Michitaka Furuya, Maryam Sharifzadeh, Jennifer Diemunsch, Jennifer Wise, Shoichi Tsuchiya, David Z. Wang
Publikováno v:
Discrete Applied Mathematics. 185:71-78
A spanning tree with no vertices of degree two is called a homeomorphically irreducible spanning tree (or a HIST) of a graph. In Furuya and Tsuchiya (2003), the sets of forbidden subgraphs that imply the existence of a HIST in a connected graph of su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88dc405e6ce39183124ac28bd0d8fd1c
https://doi.org/10.1016/j.dam.2014.12.023
https://doi.org/10.1016/j.dam.2014.12.023
Publikováno v:
SIAM Journal on Discrete Mathematics. 29:2088-2099
A sequence $\pi=(d_1,\ldots,d_n)$ is graphic if there is a simple graph $G$ with vertex set $\{v_1,\ldots,v_n\}$ such that the degree of $v_i$ is $d_i$. We say that graphic sequences $\pi_1=(d_1^{(1)},\ldots,d_n^{(1)})$ and $\pi_2=(d_1^{(2)},\ldots,d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89ee2b8a49735628304ed9d9a66c6993
https://doi.org/10.1137/140987912
https://doi.org/10.1137/140987912
Publikováno v:
Discrete Mathematics. 323:35-42
A 2-factor in a graph is a spanning 2-regular subgraph, or equivalently a spanning collection of disjoint cycles. In this paper we investigate the existence of 2-factors with a bounded number of odd cycles in a graph. We extend results of Ryjacek, Sa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d128c4c7715dce1bbec46c7e655764a9
https://doi.org/10.1016/j.disc.2014.01.005
https://doi.org/10.1016/j.disc.2014.01.005
Autor:
Jennifer Diemunsch, Nathan Graber, Derrick Stolee, Charlie Suer, Victor Larsen, Lauren M. Nelsen, Lucas Kramer, Luke L. Nelsen, Devon Sigler
Let $c:E(G)\to [k]$ be an edge-coloring of a graph $G$, not necessarily proper. For each vertex $v$, let $\bar{c}(v)=(a_1,\ldots,a_k)$, where $a_i$ is the number of edges incident to $v$ with color $i$. Reorder $\bar{c}(v)$ for every $v$ in $G$ in no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f39d2850420f2bef8c85451c6501e58b
http://arxiv.org/abs/1506.08345
http://arxiv.org/abs/1506.08345
Autor:
Florian Pfender, Jennifer Diemunsch, Paul S. Wenger, Allan Lo, Casey Moffatt, Michael Ferrara
Publikováno v:
The Electronic Journal of Combinatorics. 19
A rainbow matching in an edge-colored graph is a matching in which all the edges have distinct colors. Wang asked if there is a function $f(\delta)$ such that a properly edge-colored graph $G$ with minimum degree $\delta$ and order at least $f(\delta
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0728bded9e8f590db1afe446942861aa
https://doi.org/10.37236/2443
https://doi.org/10.37236/2443
Autor:
Bernard Lidicky, Philip DeOrsey, Michael Ferrara, Jennifer Diemunsch, Stephen G. Hartke, Luke L. Nelsen, Sogol Jahanbekam, Derrick Stolee, Nathan Graber, Eric Sullivan
Publikováno v:
Scopus-Elsevier
The strong chromatic index of a graph $G$, denoted $\chi_s'(G)$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. The strong list chromatic index, denoted $\chi_{s,\ell}'(G)$, is th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a685e061c1d393ed754746dae11c2208
http://www.scopus.com/inward/record.url?eid=2-s2.0-85051201191&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-85051201191&partnerID=MN8TOARS