210
click to vote
ICCS
2010
Springer
15 years 21 days ago
2010
Springer
Though similarities between the Semantic Web language RDF(S) and languages of the Conceptual Graphs family have often been pointed out, the differences between these formalisms hav...
124
Voted
ICCS
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. In this paper, we explore the expressivity of default CG rules (a CGoriented subset of Reiter’s default logics) through two applications. In the first one, we show tha...
GC
2010
Springer
15 years 21 days ago
2010
Springer
100
Voted
GC
2010
Springer
15 years 21 days ago
2010
Springer
A new class of polyhedra is discovered—bipyramids of arbitrarily prescribed genus. A two-dimensional generalization of Fáry’s Theorem is established. A purely combinatorial de...
120
click to vote
GC
2010
Springer
15 years 21 days ago
2010
Springer
In this paper, we give a sufficient condition for a graph to have a degree bounded spanning tree. Let n ≥ 1, k ≥ 3, c ≥ 0 and G be an n-connected graph. Suppose that for eve...
120
click to vote
GC
2010
Springer
15 years 21 days ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
100
Voted
GC
2010
Springer
15 years 21 days ago
2010
Springer
114
click to vote
GC
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. In this paper we establish two symmetric identities on sums of products of Euler polynomials.
101
Voted
GC
2010
Springer
15 years 21 days ago
2010
Springer