Recently, Letzter proved that any graph of order n contains a collection...
In this paper, we study problems of connecting classes of points via
non...
Given a property (graph class) Π, a graph G, and an integer k, the
Π-com...
The chromatic number, which refers to the minimum number of colours requ...
Tree-width and its linear variant path-width play a central role for the...
We show that every 1-planar graph with minimum degree at least 4 has gir...
We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic
...
We study homomorphism problems of signed graphs. A signed graph is an
un...
The Wiener index (the distance) of a connected graph is the sum of dista...
Wiener index, defined as the sum of distances between all unordered pair...
We study the problem of partitioning the vertex set of a given graph so ...
A digraph is n-unavoidable if it is contained in every tournament of
or...
A graph is (k_1,k_2)-colorable if its vertex set can be partitioned into...
We consider a natural restriction of the List Colouring problem: k-Regul...