820 search results - page 11 / 164 » Inducing Temporal Graphs |
ENDM
2008
13 years 8 months ago
2008
A graph G is clique-perfect if the cardinality of a maximum clique-independent set of H equals the cardinality of a minimum clique-transversal of H, for every induced subgraph H o...
DAM
2008
13 years 8 months ago
2008
13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
ACID
2006
13 years 9 months ago
2006
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
WG
2005
Springer
14 years 1 months ago
2005
Springer
We prove that for all 0 ≤ t ≤ k and d ≥ 2k, every graph G with treewidth at most k has a ‘large’ induced subgraph H, where H has treewidth at most t and every vertex in ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...