research
∙
08/03/2022
On the Computational Complexity of the Strong Geodetic Recognition Problem
A strong geodetic set of a graph G=(V,E) is a vertex set S ⊆ V(G) in whi...
share
research
∙
11/30/2020
On the proper orientation number of chordal graphs
An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
∙
11/24/2019
Intersection graph of maximal stars
A biclique of a graph G is an induced complete bipartite subgraph of G s...
research
∙
10/30/2018
Parameterized Complexity of Equitable Coloring
A graph on n vertices is equitably k-colorable if it is k-colorable and ...
research
∙
10/21/2017
