32 search results - page 2 / 7 » 1-factor covers of regular graphs |
181
click to vote
EJC
2008
15 years 5 months ago
2008
A graph may be the Kronecker cover in more than one way. In this note we explore this phenomenon and apply it to show that the minimal common cover of two graphs need not be uniqu...
138
Voted
CPC
2008
15 years 5 months ago
2008
In 1998 Luczak, R
157
Voted
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidl...
183
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
146
click to vote
DM
2006
15 years 5 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...