It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
We determine the exact and asymptotic number of unlabeled outerplanar graphs. The exact number gn of unlabeled outerplanar graphs on n vertices can be computed in polynomial time,...
Let G be a median graph on n vertices and m edges and let k be the number of equivalence classes of the Djokovi´c’s relation Θ defined on the edge-set of G. Then 2n − m −...
Sandi Klavzar, Henry Martyn Mulder, Riste Skrekovs...
We propose in this paper an extension of Conceptual Graphs that allows to use datatypes (strings, numbers, ...) for typing concept nodes. Though the model-theoretic semantics of th...
By using recent results from graph theory, including the Strong Perfect Graph Theorem, we obtain a unifying framework for a number of tractable classes of constraint problems. Thes...