research
∙
06/13/2023
On relative clique number of triangle-free planar (n,m)-graphs
An (n,m)-graph is a graph with n types of arcs and m types of edges. A h...
share
research
∙
04/03/2023
Counting the minimum number of arcs in an oriented graph having weak diameter 2
An oriented graph has weak diameter at most d if every non-adjacent pair...
research
∙
03/31/2021
