4171 search results - page 120 / 835 » Choice numbers of graphs |
143
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
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,...
177
click to vote
DM
1998
15 years 6 months ago
1998
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 −...
169
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
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...
145
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
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...
141
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. This paper presents algorithms whose input is an undirected graph, and whose output is a tree decomposition of width that approximates the optimal, the treewidth of that ...