Sciweavers

29 search results - page 2 / 6
» Skew partitions in perfect graphs
Sort
View
60
Voted
JGT
2006
60views more  JGT 2006»
14 years 11 months ago
Spanning subgraphs of graphs partitioned into two isomorphic pieces
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
Anthony Bonato
DM
2010
124views more  DM 2010»
14 years 9 months ago
Perfect dodecagon quadrangle systems
A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x1, x2, ..., x12) and a 4-cycle (x1, x4, x7, x10). A dodecagon quadrangle system of order n and index [D...
Lucia Gionfriddo, Mario Gionfriddo
87
Voted
DM
2010
99views more  DM 2010»
14 years 6 months ago
Perfect octagon quadrangle systems
An octagon quadrangle is the graph consisting of an 8-cycle (x1, x2, ..., x8) with two additional chords: the edges {x1, x4} and {x5, x8}. An octagon quadrangle system of order v ...
Luigia Berardi, Mario Gionfriddo, Rosaria Rota
73
Voted
IWPEC
2009
Springer
15 years 6 months ago
Partitioning into Sets of Bounded Cardinality
Abstract. We show that the partitions of an n-element set into k members of a given set family can be counted in time O((2− )n ), where > 0 depends only on the maximum size am...
Mikko Koivisto
SIAMJO
2008
175views more  SIAMJO 2008»
14 years 11 months ago
On Bin Packing with Conflicts
Abstract. We consider the offline and online versions of a bin packing problem called bin packing with conflicts. Given a set of items V = {1, 2, . . . , n} with sizes s1, s2 . . ....
Leah Epstein, Asaf Levin