Search Results - "Silvia Tondato"

On a problem of L. Alcón concerning path domination by Tondato, Silvia

Get full text

Walk Domination and HHD-Free Graphs by Tondato, Silvia B.

“…HHD-free is the class of graphs which contain no house, hole, or domino as induced subgraph. It is known that HHD-free graphs can be characterized via…”
Get full text

On walk domination: weakly toll domination, l2 and l3 domination by Marisa Gutierrez, Silvia Tondato

Get full text

Weakly toll convexity and proper interval graphs by Dourado, Mitre C., Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia

“…A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly toll walk} if $u_0u_i \in E(G)$ implies $u_i = u_1$ and $u_ju_k\in E(G)$ implies $u_j=u_{k-1}$. A set $S$…”
Get full text

On Models of Directed Path Graphs Non Rooted Directed Path Graphs by Gutierrez, Marisa, Tondato, Silvia B.

“…A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted directed path graph is the intersection graph of…”
Get full text

End Simplicial Vertices in Path Graphs by Gutierrez, Marisa, Tondato, Silvia B.

“…A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of…”
Get full text

Asteroidal Quadruples in non Rooted Path Graphs by Gutierrez, Marisa, Lévêque, Benjamin, Tondato, Silvia B.

“…A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family…”
Get full text

On walk domination: weakly toll domination, l 2 and l 3 domination by Gutierrez, Marisa, Tondato, Silvia

Get full text

Diclique digraphs by Gutierrez, Marisa, Llano, Bernardo, Pizaña, Miguel, Tondato, Silvia

Get full text

Convex geometries over induced paths with bounded length by Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia B.

“…In this paper we introduce the notion of lk-convexity, a natural restriction of the monophonic convexity. Let G be a graph and k≥2 an integer. A subset S⊆V(G)…”
Get full text

Computing the hull and interval numbers in the weakly toll convexity by Dourado, Mitre C., Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia

“…A walk u0u1…uk−1uk of a graph G is a weakly toll walk if u0uk∉E(G), u0ui∈E(G) implies ui=u1, and ujuk∈E(G) implies uj=uk−1. The weakly toll interval of a set…”
Get full text

Characterizations of graph classes via convex geometries: A survey by Dourado, Mitre C., Gutierrez, Marisa, Protti, Fábio, Sampaio, Rudini, Tondato, Silvia

“…Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph…”
Get full text

Special asteroidal quadruple on directed path graph non rooted path graph by Gutierrez, Marisa, Tondato, Silvia B.

“…An asteroidal triple in a graph G is a set of three non-adjacent vertices such that for any two of them there exists a path between them that does not…”
Get full text

Weakly toll convexity and proper interval graphs by Dourado, Mitre C, Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia

“…Discrete Mathematics & Theoretical Computer Science, vol. 26:2, Graph Theory (April 18, 2024) dmtcs:9837 A walk $u_0u_1 \ldots u_{k-1}u_k$ is a \textit{weakly…”
Get full text

Convex geometries over induced paths with bounded length by Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia B

“…Graph convexity spaces have been studied in many contexts. In particular, some studies are devoted to determine if a graph equipped with a convexity space is a…”
Get full text

Computing the hull and interval numbers in the weakly toll convexity by Dourado, Mitre C, Gutierrez, Marisa, Protti, Fábio, Tondato, Silvia

“…A walk $u_0u_1 \ldots u_{k-1}u_k$ of a graph $G$ is a \textit{weakly toll walk} if $u_0u_k \not\in E(G)$, $u_0u_i \in E(G)$ implies $u_i = u_1$, and $u_ju_k\in…”
Get full text

Characterizations of graph classes via convex geometries: a survey by Dourado, Mitre C, Gutierrez, Marisa, Protti, Fábio, Sampaio, Rudini, Tondato, Silvia

“…Graph convexity has been used as an important tool to better understand the structure of classes of graphs. Many studies are devoted to determine if a graph…”
Get full text

A forbidden subgraph characterization of path graphs by Tondato, Silvia B., Gutierrez, Marisa, Szwarcfiter, Jayme L.

Get full text