Sciweavers

459 search results - page 37 / 92
» Detecting induced subgraphs
Sort
View
DAM
2002
76views more  DAM 2002»
13 years 8 months ago
Block duplicate graphs and a hierarchy of chordal graphs
A block graph is a graph whose blocks are cliques. A block duplicate (BD) graph is a graph obtained by adding true twins (i.e., adjacent vertices with the same closed neighborhood...
Martin Charles Golumbic, Uri N. Peled
DM
2002
86views more  DM 2002»
13 years 8 months ago
A chip-firing game and Dirichlet eigenvalues
We consider a variation of the chip-firing game in a induced subgraph S of a graph G. Starting from a given chip configuration, if a vertex v has at least as many chips as its deg...
Fan R. K. Chung, Robert B. Ellis
JCT
2010
135views more  JCT 2010»
13 years 7 months ago
Countable connected-homogeneous graphs
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
Robert Gray, D. Macpherson
JCT
2010
112views more  JCT 2010»
13 years 7 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
WG
2010
Springer
13 years 6 months ago
Parameterized Complexity of the Arc-Preserving Subsequence Problem
Abstract. We study the Arc-Preserving Subsequence (APS) problem with unlimited annotations. Given two arc-annotated sequences P and T, this problem asks if it is possible to delete...
Dániel Marx, Ildikó Schlotter