Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Colton MA"'
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 744-748 (2020)
Given graphs G and H and a positive integer k, the Gallai-Ramsey number is the minimum integer N such that for any integer every k-edge-coloring of Kn contains either a rainbow copy of G or a monochromatic copy of H. These numbers have recently been
Externí odkaz:
https://doaj.org/article/0303cc4c2e314d63928fd5eae3627e40
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 17, Iss 3, Pp 708-712 (2020)
We show sharp Vizing-type inequalities for eternal domination. Namely, we prove that for any graphs G and H, where is the eternal domination function, α is the independence number, and is the strong product of graphs. This addresses a question of Kl
Externí odkaz:
https://doaj.org/article/c7bda301a7e64f2a925baca3982acfa4
Publikováno v:
Autopsy and Case Reports, Vol 11 (2021)
As the COVID-19 pandemic spread to the United States, it was followed by unprecedented changes. These changes did not spare undergraduate and graduate medical students. Specifically, medical students applying for residency programs were faced with a
Externí odkaz:
https://doaj.org/article/45d542cc442a4bef92ffdece345f078b
Autor:
Colton Margus, Natasha Brown, Attila J Hertelendy, Michelle R Safferman, Alexander Hart, Gregory R Ciottone
Publikováno v:
Journal of Medical Internet Research, Vol 23, Iss 7, p e28615 (2021)
BackgroundThe early conversations on social media by emergency physicians offer a window into the ongoing response to the COVID-19 pandemic. ObjectiveThis retrospective observational study of emergency physician Twitter use details how the health ca
Externí odkaz:
https://doaj.org/article/195119a545f9452e9e0cd9aae74a6346
Publikováno v:
Prompt, Vol 3, Iss 2, Pp 25-38 (2019)
Writing assignments in any mathematics course always present several challenges, particularly in lower-level classes where the students are not expecting to write more than a few words at a time. Developed based on strategies from several sources, th
Externí odkaz:
https://doaj.org/article/50df724d79b14841ba47b2deb95b51df
Autor:
Colton Magnant
Publikováno v:
Theory and Applications of Graphs, Vol 6, Iss 2 (2019)
The study of graph Ramsey numbers within restricted colorings, in particular forbidding a rainbow triangle, has recently been blossoming under the name Gallai-Ramsey numbers. In this work, we extend the main structural tool from rainbow triangle free
Externí odkaz:
https://doaj.org/article/7a84ec535d8249d7a6b19d0e4a04034e
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 2, Pp 103-106 (2016)
This note introduces the vertex proper connection number of a graph and provides a relationship to the chromatic number of minimally connected subgraphs. Also a notion of total proper connection is introduced and a question is asked about a possible
Externí odkaz:
https://doaj.org/article/dd4d7664deb24dedbcae558c941b5018
Autor:
Colton Magnant
Publikováno v:
Theory and Applications of Graphs, Vol 5, Iss 1 (2018)
Given a graph $H$ and a positive integer $k$, the $k$-color Gallai-Ramsey number $gr_{k}(K_{3} : H)$ is defined to be the minimum number of vertices $n$ for which any $k$-coloring of the complete graph $K_{n}$ contains either a rainbow triangle or a
Externí odkaz:
https://doaj.org/article/7749877dc934441485161dfd04168940
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 12, Iss 2, Pp 113-118 (2015)
The concept of graceful labeling of graphs has been extensively studied. In 1994, Mitchem and Simoson introduced a stronger concept called super-edge-graceful labeling for some classes of graphs. Among many other interesting pioneering results, Mitch
Externí odkaz:
https://doaj.org/article/ae6b1584bcd94e039f402c8da3da3d3c
Publikováno v:
Electronic Journal of Graph Theory and Applications, Vol 3, Iss 1, Pp 50-55 (2015)
Given a collection of $d$-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially
Externí odkaz:
https://doaj.org/article/3a87e6b08ad943f6976c6bed8ee877e9