Articoli con mandati relativi all'accesso pubblico - Michael YoungUlteriori informazioni
Disponibili pubblicamente: 18
Zero forcing, linear and quantum controllability for systems evolving on networks
D Burgarth, D D'Alessandro, L Hogben, S Severini, M Young
IEEE Transactions on Automatic Control 58 (9), 2349-2354, 2013
Mandati: UK Engineering and Physical Sciences Research Council
Logic circuits from zero forcing
D Burgarth, V Giovannetti, L Hogben, S Severini, M Young
Natural computing 14 (3), 485-490, 2015
Mandati: UK Engineering and Physical Sciences Research Council, Governo Italiano
Rainbow triangles in three-colored graphs
J Balogh, P Hu, B Lidický, F Pfender, J Volec, M Young
Journal of Combinatorial Theory, Series B 126, 83-113, 2017
Mandati: US National Science Foundation, European Commission
On crossing numbers of complete tripartite and balanced complete multipartite graphs
E Gethner, L Hogben, B Lidický, F Pfender, A Ruiz, M Young
Journal of Graph Theory 84 (4), 552-565, 2017
Mandati: US National Science Foundation
Zero forcing propagation time on oriented graphs
A Berliner, C Bozeman, S Butler, M Catral, L Hogben, B Kroschel, JCH Lin, ...
Discrete Applied Mathematics 224, 45-59, 2017
Mandati: US National Science Foundation
The enhanced principal rank characteristic sequence
S Butler, M Catral, SM Fallat, HT Hall, L Hogben, P van den Driessche, ...
Linear Algebra and its Applications 498, 181-200, 2016
Mandati: Natural Sciences and Engineering Research Council of Canada
Turán numbers of vertex-disjoint cliques in r-partite graphs
J De Silva, K Heysse, A Kapilow, A Schenfisch, M Young
Discrete Mathematics 341 (2), 492-496, 2018
Mandati: US National Science Foundation
Fractional zero forcing via three-color forcing games
L Hogben, KF Palmowski, DE Roberson, M Young
Discrete Applied Mathematics 213, 114-129, 2016
Mandati: National Research Foundation, Singapore
On leaky forcing and resilience
JS Alameda, J Kritschgau, N Warnberg, M Young
Discrete Applied Mathematics 306, 32-45, 2022
Mandati: US National Science Foundation
Families of graphs with maximum nullity equal to zero forcing number
JS Alameda, E Curl, A Grez, L Hogben, A Schulte, D Young, M Young
Special Matrices 6 (1), 56-67, 2018
Mandati: US National Science Foundation
Anti-van der Waerden numbers on graphs
Z Berikkyzy, A Schulte, E Sprangel, S Walker, N Warnberg, M Young
Graphs and Combinatorics 38 (4), 124, 2022
Mandati: US National Science Foundation
Polychromatic colorings of complete graphs with respect to 1‐, 2‐factors and Hamiltonian cycles
M Axenovich, J Goldwasser, R Hansen, B Lidický, RR Martin, D Offner, ...
Journal of Graph Theory 87 (4), 660-671, 2018
Mandati: US National Science Foundation
An upper bound for the k-power domination number in r-uniform hypergraphs
JS Alameda, F Kenter, K Meagher, M Young
Discrete Mathematics 345 (11), 113038, 2022
Mandati: US National Science Foundation, US Department of Defense, Natural Sciences …
Anti-van der Waerden numbers on Graphs
A Schulte, N Warnberg, M Young
arXiv preprint arXiv:1802.01509, 2018
Mandati: US National Science Foundation
“I Got You”: Centering Identities and Humanness in Collaborations Between Mathematics Educators and Mathematicians
AM Marshall, S Sword, M Applegate, S Greenstein, T Pendleton, KE Yong, ...
Journal of Humanistic Mathematics 13 (2), 309-337, 2023
Mandati: US National Science Foundation
The Polychromatic Number of Small Subsets of the Integers Modulo n
E Curl, J Goldwasser, J Sampson, M Young
Graphs and Combinatorics 38 (3), 57, 2022
Mandati: US National Science Foundation
You say brutal, I say Thursday: Isn't it obvious?
S Sword, A Marshall, M Young
Mathematics Education Across Cultures: Proceedings 42nd PME-NA, 2020
Mandati: US National Science Foundation
Polychromatic Colorings on the Integers
J Talbot, M Axenovich, J Goldwasser, B Lidicky, R Martin, D Offner, ...
Integers: Electronic Journal of Combinatorial Number Theory 19 (A18), 2019
Mandati: US National Science Foundation
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software