496 search results - page 46 / 100 » C4-saturated bipartite graphs |
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
COCOON
2009
Springer
14 years 2 months ago
2009
Springer
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid pa...
CATS
2008
13 years 9 months ago
2008
G is a well-covered graph provided all its maximal stable sets are of the same size (Plummer, 1970). S is a local maximum stable set of G, and we denote by S (G), if S is a maxim...
GC
2010
Springer
13 years 5 months ago
2010
Springer
A graph of order n is said to be pancyclic if it contains cycles of all lengths from three to n. Let G be a hamiltonian graph and let x and y be vertices of G that are consecutive ...
NIPS
1996
13 years 9 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...