Zobrazeno 1 - 10
of 244
pro vyhledávání: '"Thomas, P. John"'
In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour $V(G)$ such that each colour class has the no-three-in-line property. We determine bo
Externí odkaz:
http://arxiv.org/abs/2408.13494
Autor:
Thankachy, Maya, Thomas, Elias John, Chandran, Ullas, Tuite, James, Di Stefano, Gabriele, Erskine, Grahame
In this paper we generalise the notion of visibility from a point in an integer lattice to the setting of graph theory. For a vertex $x$ of a connected graph $G$, we say that a set $S \subseteq V(G)$ is an \emph{$x$-position set} if for any $y \in S$
Externí odkaz:
http://arxiv.org/abs/2209.00359
The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set $S$ of vertices of a graph $G$ is a \emph{general position set} if no shortest path in $G$ contains three or more vertices of $S$. The
Externí odkaz:
http://arxiv.org/abs/2203.08170
Autor:
Brenda Sequeira Dmello, Thomas Wiswa John, Natasha Housseine, Dan Wolf Meyrowitsch, Jos van Roosmalen, Thomas van den Akker, Monica Lauridsen Kujabi, Charles Festo, Daniel Nkungu, Zainab Muniro, Idrissa Kabanda, Rukia Msumi, Luzango Maembe, Mtingele Sangalala, Ester Hyera, Joyce Lema, Scolastica Bayongo, Johnson Mshiu, Hussein Lesio Kidanto, Nanna Maaløe
Publikováno v:
BMC Pregnancy and Childbirth, Vol 24, Iss 1, Pp 1-15 (2024)
Abstract Introduction Tanzania has one of the highest burdens of perinatal mortality, with a higher risk among urban versus rural women. To understand the characteristics of perinatal mortality in urban health facilities, study objectives were: I. To
Externí odkaz:
https://doaj.org/article/73c4b4686bbb411489b025390f53b686
Autor:
Stephens, Gareth F., Wilson, Jack A., Curling, Simon F., He, Guanze, Thomas, P. John, Williams, David W., Ortner, Susan, Grovenor, Chris, Rushton, Michael J.D., Baker, Aidan Cole, Middleburgh, Simon C.
Publikováno v:
In Progress in Nuclear Energy June 2024 171
The general position number of a graph $G$ is the size of the largest set of vertices $S$ such that no geodesic of $G$ contains more than two elements of $S$. The monophonic position number of a graph is defined similarly, but with `induced path' in
Externí odkaz:
http://arxiv.org/abs/2106.06827
The general position problem in graph theory asks for the largest set $S$ of vertices of a graph $G$ such that no shortest path of $G$ contains more than two vertices of $S$. In this paper we consider a variant of the general position problem called
Externí odkaz:
http://arxiv.org/abs/2012.10330
Getting inspired by the famous no-three-in-line problem and by the general position subset selection problem from discrete geometry, the same is introduced into graph theory as follows. A set $S$ of vertices in a graph $G$ is a general position set i
Externí odkaz:
http://arxiv.org/abs/2004.04648