Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Breeann Flesch"'
Publikováno v:
Theory and Applications of Graphs, Vol 11, Iss 1, Pp 1-14 (2024)
A $k$-majority tournament $T$ on a finite set of vertices $V$ is defined by a set of $2k-1$ linear orders on $V$, with an edge $u \to v$ in $T$ if $u>v$ in a majority of the linear orders. We think of the linear orders as voter preferences and the ve
Externí odkaz:
https://doaj.org/article/7b9170dc05214b81999014ff863eea30
Publikováno v:
International Journal of Computer Science Education in Schools. 4:31-48
Increasing the inclusion of underrepresented individuals in coding is an intractable problem, with a variety of initiatives trying to improve the situation. Many of these initiatives involve STEAM education, which combines the arts with traditional S
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::077fa750b7faca7f2f074c315909d978
https://doi.org/10.21585/ijcses.v4i3.109
https://doi.org/10.21585/ijcses.v4i3.109
Publikováno v:
Order. 35:495-514
An interval k-graph is the intersection graph of a family of intervals of the real line partitioned into k classes with vertices adjacent if and only if their corresponding intervals intersect and belong to different classes. In this paper we study t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2a086710db5dbba3882337269565babf
https://doi.org/10.1007/s11083-017-9445-0
https://doi.org/10.1007/s11083-017-9445-0
Autor:
Breeann Flesch, Matthew Nabity
Publikováno v:
British Journal of Mathematics & Computer Science. 18:1-11
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a95d76e25c7151a0cc20454ab58c2701
https://doi.org/10.9734/bjmcs/2016/28344
https://doi.org/10.9734/bjmcs/2016/28344
Autor:
David E. Brown, Breeann Flesch
Publikováno v:
Journal of Discrete Mathematics. 2014:1-7
An interval p-graph is the intersection graph of a collection of intervals which have been colored with p different colors with edges corresponding to nonempty intersection of intervals from different color classes. We characterize the class of 2-tre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::58ad3967f50a3530ced662377f3f18c8
https://doi.org/10.1155/2014/143809
https://doi.org/10.1155/2014/143809
Publikováno v:
The Electronic Journal of Combinatorics. 18
A coloring of the vertices of a graph $G$ is said to be distinguishing provided that no nontrivial automorphism of $G$ preserves all of the vertex colors. The distinguishing number of $G$, denoted $D(G)$, is the minimum number of colors in a distingu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f870134458e6b9a9592b4a10b82ca896
https://doi.org/10.37236/648
https://doi.org/10.37236/648
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 34, Iss 3, Pp 509-527 (2014)
A graph is a probe interval graph if its vertices correspond to some set of intervals of the real line and can be partitioned into sets P and N so that vertices are adjacent if and only if their corresponding intervals intersect and at least one belo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::931b65121f25975c8baabc7264920861
https://doi.org/10.7151/dmgt.1754
https://doi.org/10.7151/dmgt.1754