1105 search results - page 61 / 221 » Linear choosability of graphs |
107
click to vote
DM
2007
14 years 12 months ago
2007
Switch-setting games like Lights Out are typically modelled as a graph, where the vertices represent switches and lamps, and the edges capture the switching rules. We generalize t...
106
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
102
click to vote
ICPR
2000
IEEE
16 years 29 days ago
2000
IEEE
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
100
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
JGT
2007
14 years 11 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...