Zobrazeno 1 - 10
of 37
pro vyhledávání: '"Stephen Finbow"'
Publikováno v:
Mathematics, Vol 10, Iss 15, p 2787 (2022)
The acyclic chromatic index χa′(G) of a graph G is the smallest k for which G is a proper edge colorable using k colors. A 1-planar graph is a graph that can be drawn in plane such that every edge is crossed by at most one other edge. In this pape
Externí odkaz:
https://doaj.org/article/036609b250ef4d819a5c9eaf0c7670d7
Publikováno v:
Algorithms, Vol 12, Iss 8, p 153 (2019)
For a graph G = ( V , E ) , the γ -graph of G, denoted G ( γ ) = ( V ( γ ) , E ( γ ) ) , is the graph whose vertex set is the collection of minimum dominating sets, or γ -sets of G, and two γ -sets are adjacent in G (
Externí odkaz:
https://doaj.org/article/f5cc0f6c2949474f9681db296c53228e
Publikováno v:
Discrete Applied Mathematics. 285:182-187
For a graph G = ( V , E ) , the γ -graph of G , G ( γ ) = ( V ( γ ) , E ( γ ) ) , is the graph whose vertex set is the collection of minimum dominating sets, or γ -sets of G , and two γ -sets are adjacent in G ( γ ) if they differ by a single
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9326851950a248658f43a712c0d79e4a
https://doi.org/10.1016/j.dam.2020.05.005
https://doi.org/10.1016/j.dam.2020.05.005
Autor:
Andrea Burgess, Nancy E. Clarke, Rosalind A. Cameron, Peter Danziger, Stephen Finbow, Caleb W. Jones, David A. Pike
Publikováno v:
Discrete Applied Mathematics. 285:552-566
We introduce the game of Surrounding Cops and Robbers on a graph, as a variant of the original game of Cops and Robbers. In contrast to the original game in which the cops win by occupying the same vertex as the robber, they now win by occupying each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a5f39f1e89469cc9eda00301580b23f
https://doi.org/10.1016/j.dam.2020.06.019
https://doi.org/10.1016/j.dam.2020.06.019
Publikováno v:
International Journal of Game Theory. 47:543-555
We consider the “all guards move” model for the eternal dominating set problem. A set of guards form a dominating set on a graph and at the beginning of each round, a vertex not in the dominating set is attacked. To defend against the attack, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6042616d48472e9d682ca2e6f222ed2
https://doi.org/10.1007/s00182-018-0623-0
https://doi.org/10.1007/s00182-018-0623-0
Autor:
Margaret-Ellen Messinger, Nancy E. Clarke, Stephen Finbow, Anthony Bonato, F. Mc Inerney, Danielle Cox
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, 794, pp.59-68
Theoretical Computer Science, Elsevier, 2019, 794, pp.59-68
Theoretical Computer Science, 2019, 794, pp.59-68
Theoretical Computer Science, Elsevier, 2019, 794, pp.59-68
We introduce a new variant of the game of Cops and Robbers played on graphs, where the robber is invisible unless outside the neighbor set of a cop. The hyperopic cop number is the corresponding analogue of the cop number, and we investigate bounds a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ccb3c04849fa07a9c478699c0f20210
https://inria.hal.science/hal-01627391v2/file/HyperopicCops0826.pdf
https://inria.hal.science/hal-01627391v2/file/HyperopicCops0826.pdf
Autor:
Rebecca Milley, Margaret-Ellen Messinger, Shannon J. Fitzpatrick, Stephen Finbow, Richard J. Nowakowski, Nancy E. Clarke
Publikováno v:
Discrete Applied Mathematics. 202:1-7
A proper colouring is referred to as a Grundy colouring, or first-fit colouring if every vertex has a neighbour from each of the colour classes lower than its own. The Grundy number of a graph is the maximum k (number of colours) such that a Grundy c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54b780c9fd047a7e51ecb76afe779f1e
https://doi.org/10.1016/j.dam.2015.08.018
https://doi.org/10.1016/j.dam.2015.08.018
Publikováno v:
Discrete Mathematics, Algorithms and Applications. 12:2050035
The adjacent vertex distinguishing edge coloring of a graph [Formula: see text] is a proper edge coloring of [Formula: see text] such that the color sets of any pair of adjacent vertices are distinct. The minimum number of colors required for an adja
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::838009593577831df0ae2a50679177d7
https://doi.org/10.1142/s1793830920500354
https://doi.org/10.1142/s1793830920500354
Publikováno v:
Applied Mathematics and Computation. 374:125032
Let G = ( V , E ) be a graph. A ( Δ d 1 , Δ d 2 ) -partition of a graph G is the partition of V(G) into two non-empty subsets V1 and V2, such that G[V1] and G[V2] are graphs with maximum degree at most d1 and d2, respectively. A similar definition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ede295be84295c0f46d3c9b6ea4fb5b4
https://doi.org/10.1016/j.amc.2020.125032
https://doi.org/10.1016/j.amc.2020.125032