Results 161 to 170 of about 3,384,024 (197)

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. [PDF]

Dyn Games Appl
Kiefer S, Mayr R, Shirmohammadi M, Totzke P.   +3 more
europepmc   +1 more source

On the forbidden induced subgraph sandwich problem

Discrete Applied Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Murilo da Silva, Celina Miraglia Herrera de Figueiredo, Simone Dantas   +2 more
exaly   +5 more sources

Two forbidden induced subgraphs and well-quasi-ordering [PDF]

Discrete Mathematics, 2011
It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-ordered by the induced subgraph relation if and only if G is an induced subgraph of P(4).
Nicholas Korpelainen, Vadim Lozin
exaly   +4 more sources

A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers [PDF]

Discrete Mathematics, 2009
A graph G is a k-leaf power if there is a tree T such that the vertices of G are the leaves of T and two vertices are adjacent in G if and only if their distance in T is at most k. In this situation T is called a k-leaf root of G. Motivated by the search
Dieter Rautenbach, Andreas Brandstädt
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Forbidden induced subgraph characterization of cograph contractions

Journal of Graph Theory, 2004
AbstractLet S1, S2,…,St be pairwise disjoint non‐empty stable sets in a graph H. The graph H* is obtained from H by: (i) replacing each Si by a new vertex qi; (ii) joining each qi and qj, 1 ≤ i # j ≤ t, and; (iii) joining qi to all vertices in H – (S1 ∪ S2 ∪ ··· ∪ St) which were adjacent to some vertex of Si. A cograph is a P4‐free graph.
I. Zverovich, I. I. Zverovich
exaly   +5 more sources

Polynomial $$\chi $$χ-Binding Functions and Forbidden Induced Subgraphs: A Survey

Graphs and Combinatorics, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Schiermeyer, B. Randerath
semanticscholar   +4 more sources

List-3-Coloring Ordered Graphs with a Forbidden Induced Subgraph [PDF]

SIAM Journal on Discrete Mathematics
The List-3-Coloring Problem is to decide, given a graph $G$ and a list $L(v)\subseteq \{1,2,3\}$ of colors assigned to each vertex $v$ of $G$, whether $G$ admits a proper coloring $\phi$ with $\phi(v)\in L(v)$ for every vertex $v$ of $G$, and the $3 ...
Sophie Spirkl
exaly   +6 more sources