459 search results - page 6 / 92 » Detecting induced subgraphs |
CCCG
2009
13 years 8 months ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
CP
2011
Springer
12 years 7 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...
BMCBI
2006
13 years 7 months ago
2006
Background: Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this p...
COMBINATORICA
2006
13 years 7 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
ARSCOM
2006
13 years 7 months ago
2006
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph ...