research
∙
05/25/2023
Corrigendum to "On the monophonic rank of a graph" [Discrete Math. Theor. Comput. Sci. 24:1 (2022) #3]
In this corrigendum, we give a counterexample to Theorem 5.2 in “On the ...
share
research
∙
04/30/2023
The iteration time and the general position number in graph convexities
In this paper, we study two graph convexity parameters: iteration time a...
research
∙
03/13/2023
Computing the hull and interval numbers in the weakly toll convexity
A walk u_0u_1 … u_k-1u_k of a graph G is a weakly toll walk if u_0u_k ∉E...
research
∙
08/06/2022
Expanded-clique graphs and the domination problem
Given a graph G and a function f : V(G) →ℕ such that f(v_i) ≥ d(v_i) for...
research
∙
04/14/2022
On restricted completions of chordal and trivially perfect graphs
Let G be a graph having a vertex v such that H = G - v is a trivially pe...
research
∙
03/31/2022
Weakly toll convexity and proper interval graphs
A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i ∈ E(G) implies ...
research
∙
03/29/2022
Characterizations of graph classes via convex geometries: A survey
Graph convexity has been used as an important tool to better understand ...
research
∙
01/29/2022
On the generalized Helly property of hypergraphs, cliques, and bicliques
A family of sets is (p,q)-intersecting if every nonempty subfamily of p ...
research
∙
10/03/2020
On the monophonic rank of a graph
A set of vertices S of a graph G is monophonically convex if every induc...
research
∙
04/30/2019