Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Matt Noble"'
Autor:
Matt Noble
Publikováno v:
Theory and Applications of Graphs, Vol 10, Iss 1, Pp 1-9 (2022)
An edge coloring of a simple graph G is said to be proper rainbow-cycle-forbidding (PRCF, for short) if no two incident edges receive the same color and for any cycle in G, at least two edges of that cycle receive the same color. A graph G is defined
Externí odkaz:
https://doaj.org/article/68b573be15e14162b8996db58dc274b0
Publikováno v:
Theory and Applications of Graphs, Vol 5, Iss 1 (2018)
We introduce and study $\gamma'$-realizable sequences. For a finite, simple graph $G$ containing no isolated vertices, $I \subseteq V(G)$ is said to be an \emph{inverse dominating set} if $I$ dominates all of $G$ and $I$ is contained by the complemen
Externí odkaz:
https://doaj.org/article/99da9326924345819d132d8c3e3ba732
Publikováno v:
Theory and Applications of Graphs, Vol 4, Iss 2 (2017)
An extremal result about vertex covers, attributed by Hajnal to Erdős and Gallai, is applied to prove the following: If n, k, and t are integers satisfying n ≥ k ≥ t ≥ 3 and k ≤ 2t - 2, and G is a graph with the minimum number of edges among
Externí odkaz:
https://doaj.org/article/28b7bdd788a24e6ba2628980713b609b
Autor:
Matt Noble
Publikováno v:
Theory and Applications of Graphs, Vol 2, Iss 1 (2015)
We consider Euclidean distance graphs with vertex set Q2 or Z2 and address the possibility or impossibility of finding isomorphisms between such graphs. It is observed that for any distances d1, d2 the non-trivial distance graphs G(Q2, d1) and G(Q2,
Externí odkaz:
https://doaj.org/article/80cbec5293ed48678525763e6b57bd72
Autor:
Jonathan M. Abell, Michael A. Pingram, Deniz Özkundakci, Bruno O. David, Mike Scarsbrook, Thomas Wilding, Alicia Williams, Matt Noble, James Brasington, Alton Perrie
Publikováno v:
Regional Environmental Change. 23
New Zealand (NZ) has a diversity of large river ecosystems that provide essential ecosystem services but are impaired by multiple ecological impacts. River restoration is an active field worldwide and there is good potential for river restoration pra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e5d1f41ce50c998b170d0ad3bea3a6a6
https://doi.org/10.1007/s10113-022-01995-z
https://doi.org/10.1007/s10113-022-01995-z
Publikováno v:
Post reproductive health. 28(4)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pmid________::b52492e0166c6d553adf8cf3a47ff4e4
https://pubmed.ncbi.nlm.nih.gov/36375825
https://pubmed.ncbi.nlm.nih.gov/36375825
Autor:
Matt Noble, Tim Child
Publikováno v:
Human Fertility. 25:283-290
In the United Kingdom, between 2012 and 2017 the annual number of frozen-thawed embryo replacement (FER) cycles doubled, while fresh cycles declined. With FER now accounting for 34% of IVF cycles, the aim of this UK-wide survey of IVF clinics was to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ac16aa0a134c84ef29d966526ea2295
https://doi.org/10.1080/14647273.2020.1786171
https://doi.org/10.1080/14647273.2020.1786171
Autor:
Matt Noble, Tim Child
Publikováno v:
The Obstetrician & Gynaecologist. 22:57-68
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ca13dbec49864fc9e177ba1710b7743
https://doi.org/10.1111/tog.12630
https://doi.org/10.1111/tog.12630
Autor:
Joe Chaffee, Matt Noble
Publikováno v:
Graphs and Combinatorics. 33:1565-1576
The dimension of a graph G is defined to be the minimum n such that G has a representation as a unit-distance graph in $${{\mathbb {R}}}^n$$ . In this article, we show that a dimension 6 graph with minimum edge-set has exactly 21 edges, with this min
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6afdc0073e724595ef50aa7bd0898775
https://doi.org/10.1007/s00373-017-1854-8
https://doi.org/10.1007/s00373-017-1854-8