3 citations · 3 across the 7 of their papers we have counts for
8 papers
The general position number of digraphs
Ullas Chandran S. V., Gabriele Di Stefano, Grahame Erskine +3
The general position number for graphs ask for largest vertex subsets such that no three vertices are contained on a common shortest path. We examine this problem in the settin…
Colouring a graph with position sets
Ullas Chandran S. V., Gabriele Di Stefano, Haritha S. +2
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 the vertices of…
On the Vertex Position Number of Graphs
Maya Thankachy, Elias John Thomas, Ullas Chandran +3
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 of a connected graph , we say that a set…
On the General Position Number of Mycielskian Graphs
Elias John Thomas, Ullas Chandran, James Tuite +1
The general position problem for graphs was inspired by the no-three-in-line problem from discrete geometry. A set of vertices of a graph is a \emph{general position set} i…
On some extremal position problems for graphs
James Tuite, Elias John Thomas, Ullas Chandran S. V.
The general position number of a graph is the size of the largest set of vertices such that no geodesic of contains more than two elements of . The monophonic positi…
On monophonic position sets in graphs
Elias John Thomas, S. V. Ullas Chandran, James Tuite +1
The general position problem in graph theory asks for the largest set of vertices of a graph such that no shortest path of contains more than two vertices of . In th…
Characterization of classes of graphs with large general position number
Elias John Thomas, Ullas Chandran S. V.
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 fol…
Characterization of general position sets and its applications to cographs and bipartite graphs
Bijo S. Anand, Ullas Chandran S. V., Manoj Changat +2
A vertex subset of a graph is a general position set of if no vertex of lies on a geodesic between two other vertices of . The cardinality of a largest general p…