DOIAbstract
AbstractIn 1996, Matheson and Tarjan conjectured that any n-vertex plane triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6
AbstractIn 1996, Matheson and Tarjan conjectured that any n-vertex plane triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it...
AbstractIn this paper, we answer two conjectures of De Loera, Santos, and Takeuchi by demonstrating ...
AbstractIn 1996, Matheson and Tarjan conjectured that any n-vertex plane triangulation with n suffic...
AbstractMotivated by an application to unstructured multigrid calculations, we consider the problem ...
An annulus triangulation G is a 2-connected plane graph with two disjoint faces f1 and f2 such that ...
Motivated by an application to unstructured multigrid calculations, we consider the problem of asymp...
We show that every simple planar near-triangulation with minimum degree at least three contains two ...
AbstractWe prove the existence of certain spanning subgraphs of graphs embedded in the torus and the...
A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least o...
AbstractIn this paper we analyze the computational complexity of the min-max degree triangulation pr...
A planar graph G = (V,E) is a graph that can be embedded in the plane, i.e. it can be drawn in the p...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adj...
In the domination game on the graph G, the players Dominator and Staller alternately select vertices...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it...
AbstractIn this paper, we answer two conjectures of De Loera, Santos, and Takeuchi by demonstrating ...
AbstractIn 1996, Matheson and Tarjan conjectured that any n-vertex plane triangulation with n suffic...
AbstractMotivated by an application to unstructured multigrid calculations, we consider the problem ...
An annulus triangulation G is a 2-connected plane graph with two disjoint faces f1 and f2 such that ...
Motivated by an application to unstructured multigrid calculations, we consider the problem of asymp...
We show that every simple planar near-triangulation with minimum degree at least three contains two ...
AbstractWe prove the existence of certain spanning subgraphs of graphs embedded in the torus and the...
A total dominating set of a graph is a subset of such that every vertex in is adjacent to at least o...
AbstractIn this paper we analyze the computational complexity of the min-max degree triangulation pr...
A planar graph G = (V,E) is a graph that can be embedded in the plane, i.e. it can be drawn in the p...
A set D subset of V(G) of a graph G is a dominating set if every vertex v is an element of V(G) is e...
A dominating set of a graph $G$ is a subset $D$ of vertices such that every vertex not in $D$ is adj...
In the domination game on the graph G, the players Dominator and Staller alternately select vertices...
Upper and lower bounds for the number of geometric graphs of specific types on a given set of points...
213–229) proved that planar graphs of diameter three have domination number at most ten. Recently it...
AbstractIn this paper, we answer two conjectures of De Loera, Santos, and Takeuchi by demonstrating ...
Add to ORKG