Sciweavers

347 search results - page 8 / 70
» Schaefer's theorem for graphs
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
16 years 5 months ago
Approximate max-integral-flow/min-multicut theorems
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
Kenji Obata
FOCS
2005
IEEE
15 years 10 months ago
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
At the core of the seminal Graph Minor Theory of Robertson and Seymour is a powerful structural theorem capturing the structure of graphs excluding a fixed minor. This result is ...
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Ken-ic...
DAM
2007
82views more  DAM 2007»
15 years 4 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang
COMBINATORICS
2007
73views more  COMBINATORICS 2007»
15 years 4 months ago
A Short Proof of a Theorem of Kano and Yu on Factors in Regular Graphs
In this note we present a short proof of the following result, which is a slight extension of a nice 2005 theorem by Kano and Yu. Let e be an edge of an rregular graph G. If G has...
Lutz Volkmann
ENTCS
2011
56views more  ENTCS 2011»
14 years 11 months ago
Feynman Graphs, and Nerve Theorem for Compact Symmetric Multicategories (Extended Abstract)
d abstract) Andr´e Joyal 1 D´epartement des math´ematiques Universit´e du Qu´ebec `a Montr´eal Canada Joachim Kock 2 3 Departament de matem`atiques Universitat Aut`onoma de B...
André Joyal, Joachim Kock