14 search results - page 1 / 3 » Flips in Graphs |
SIAMDM
2008
13 years 4 months ago
2008
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
We study a switch Markov chain on regular graphs, where switches are allowed only between links that are at distance 3; we call this the Flip. The motivation for studying the Flip...
SWAT
2004
Springer
13 years 10 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
EJC
2010
13 years 4 months ago
2010
Let S be a connected graph which contains an induced path of n-1 vertices, where n is the order of S. We consider a puzzle on S. A configuration of the puzzle is simply an n-dimen...
COMPGEOM
2007
ACM
13 years 8 months ago
2007
ACM
