Sciweavers

ICLA
2009
Springer
13 years 9 months ago
Connection Matrices for MSOL-Definable Structural Invariants
Abstract. Connection matrices of graph parameters were first introduced by M. Freedman, L. Lov
Johann A. Makowsky
DM
2010
102views more  DM 2010»
13 years 11 months ago
Covering graphs with matchings of fixed size
Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has siz...
David Cariolaro, Hung-Lin Fu
DAM
2010
92views more  DAM 2010»
13 years 11 months ago
Enumeration of matchings in families of self-similar graphs
The number of matchings of a graph G is an important graph parameter in various contexts, notably in statistical physics (dimer-monomer model). Following recent research on graph p...
Elmar Teufl, Stephan Wagner
LATIN
2004
Springer
14 years 5 months ago
Bidimensional Parameters and Local Treewidth
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Ha...