347 search results - page 43 / 70 » Schaefer's theorem for graphs |
87
Voted
DAM
2010
14 years 9 months ago
2010
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assign...
ENTCS
2008
14 years 9 months ago
2008
The better known methods of semantic tableaux for deciding satisfiability in propositional linear temporal logic generate graphs in addition to classical trees. The test of satisf...
73
Voted
JGT
2008
14 years 9 months ago
2008
The measurable list chromatic number of a graph G is the smallest number such that if each vertex v of G is assigned a set L(v) of measure in a fixed atomless measure space, the...
95
Voted
JCT
2006
14 years 9 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
110
click to vote
SODA
2012
ACM
12 years 12 months ago
2012
ACM
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...