Zobrazeno 1 - 10
of 260
pro vyhledávání: '"McDonald, Jessica"'
Autor:
Galindo, Rachel, McDonald, Jessica
An equivalent version of the Borodin-Kostochka Conjecture, due to Cranston and Rabern, says that any graph with $\chi = \Delta = 9$ contains $K_3 \lor E_6$ as a subgraph. Here we prove several results in support of this conjecture, where vertex-criti
Externí odkaz:
http://arxiv.org/abs/2408.12693
Let $H$ be a 2-regular graph and let $G$ be obtained from $H$ by gluing in vertex-disjoint copies of $K_4$. The "cycles plus $K_4$'s" problem is to show that $G$ is 4-colourable; this is a special case of the \emph{Strong Colouring Conjecture}. In th
Externí odkaz:
http://arxiv.org/abs/2406.17723
Autor:
Henderschedt, Owen, McDonald, Jessica
Let $G$ be a $d$-regular graph and let $F\subseteq\{0, 1, 2, \ldots, d\}$ be a list of forbidden out-degrees. Akbari, Dalirrooyfard, Ehsani, Ozeki, and Sherkati conjectured that if $|F|<\tfrac{1}{2}d$, then $G$ should admit an $F$-avoiding orientatio
Externí odkaz:
http://arxiv.org/abs/2406.05095
We prove that for any graph $G$, the total chromatic number of $G$ is at most $\Delta(G)+2\left\lceil \frac{|V(G)|}{\Delta(G)+1} \right\rceil$. This saves one color in comparison with a result of Hind from 1992. In particular, our result says that if
Externí odkaz:
http://arxiv.org/abs/2405.07382
Motivated by different characterizations of planar graphs and the 4-Color Theorem, several structural results concerning graphs of high chromatic number have been obtained. Toward strengthening some of these results, we consider the \emph{balanced ch
Externí odkaz:
http://arxiv.org/abs/2308.01242
Jaeger, Linial, Payan, and Tarsi introduced the notion of $A$-connectivity for graphs in 1992, and proved a decomposition for cubic graphs from which $A$-connectivity follows for all 3-edge-connected graphs when $|A|\geq 6$. The concept of $A$-connec
Externí odkaz:
http://arxiv.org/abs/2306.04151
In 1981 Seymour proved his famous 6-flow theorem asserting that every 2-edge-connected graph has a nowhere-zero flow in the group ${\mathbb Z}_2 \times {\mathbb Z}_3$ (in fact, he offers two proofs of this result). In this note we give a new short pr
Externí odkaz:
http://arxiv.org/abs/2302.08625
Autor:
McDonald, Jessica, Bennett, Hunter, Fuller, Joel, Jones, Stephen, Debenedictis, Tom, Chalmers, Samuel
Publikováno v:
In Journal of Science and Medicine in Sport November 2024 27(11):779-785
Autor:
McNamara, Bridgette J., McDonald, Jessica, Heard, Kelvin, Friedman, N. Deborah, Diver, Frances, Athan, Eugene, Wade, Amanda J., Brennan, Fiona, Warburton, Melissa, Bartolo, Caroline, Maggs, Callum, Miller, Nicole, Smith, Megan, Stenos, John, O’Brien, Daniel P.
Publikováno v:
In Australian and New Zealand Journal of Public Health October 2024 48(5)
Autor:
McDonald, Jessica J.
Publikováno v:
Connect to the thesis.
Thesis (B.A.)--Haverford College, Dept. of English, 2006.
Includes bibliographical references.
Includes bibliographical references.
Externí odkaz:
http://hdl.handle.net/10066/637