1410 search results - page 74 / 282 » Proving theorems by reuse |
171
click to vote
TCS
2008
15 years 5 months ago
2008
This article presents formalized intuitionistic proofs for the polyhedra genus theorem, the Euler formula and a sufficient condition of planarity. They are based on a hypermap mod...
138
click to vote
DAM
1998
15 years 5 months ago
1998
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to...
172
Voted
MPC
2010
Springer
15 years 10 months ago
2010
Springer
We show a new and constructive proof of the two-squares theorem, based on a somewhat unusual, but very effective, way of rewriting the so-called extended Euclid’s algorithm. Rat...
146
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
181
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...