Search Results - "Sanaei, Asiyeh"

Ambush Cops and Robbers by Clarke, Nancy E., Creighton, Melissa, Murray, Patrick, Sanaei, Asiyeh

“…A variation of the Cops and Robber game is introduced in which the robber side consists of two robbers. The cops win by moving onto the same vertex as one of…”
Get full text

Existential closure of block intersection graphs of infinite designs having finite block size and index by Pike, David A., Sanaei, Asiyeh

“…In this article we study the n‐existential closure property of the block intersection graphs of infinite t‐(v, k, λ) designs for which the block size k and the…”
Get full text

Existential closure of block intersection graphs of infinite designs having infinite block size by Horsley, Daniel, Pike, David A., Sanaei, Asiyeh

“…A graph G is n‐existentially closed (n‐e.c.) if for each pair (A, B) of disjoint subsets of V(G) with |A| + |B|≤n there exists a vertex in V(G)\(A∪B) which is…”
Get full text

Three-colourability of planar graphs with no 5- or triangular {3,6}-cycles by Farzad, Babak, Sanaei, Asiyeh

“…Steinberg's conjecture asserts that every planar graph without 4- and 5-cycles is 3-colourable. In this paper, we prove that planar graphs without 5-cycles and…”
Get full text

PSEUDO-SKOLEM SEQUENCES AND GRAPH SKOLEM LABELLING by PIKE, DAVID A., SANAEI, ASIYEH, SHALABY, NABIL

“…Pseudo-Skolem sequences, which are similar to Skolem-type sequences in their structure and applications, are introduced. Constructions of such sequences,…”
Get full text

Existential closure of graphs by Sanaei, Asiyeh

“…We study the n-existential closure property of graphs which was first considered by Erdo s and Rényi in 1963. A graph G is said to be n-existentially closed,…”
Get full text