Titlebook: ;

PALMY

febrile

https://doi.org/10.1007/978-3-322-90466-9at a . of a perfect strip-composed graph, with the basic graphs belonging to a class ., can be found in polynomial time, provided that the . problem can be solved on . in polynomial time. We also design a new, more efficient, combinatorial algorithm for the . problem on strip-composed claw-free perfect graphs.

audiologist

Moderne Organisationstheorien 2 graph classes for all but finitely many cases, whenever neither of the forbidden graphs is a clique, a pan, or a complement of these graphs. Further reducing the remaining open cases we show that (with respect to graph isomorphism) forbidding a pan is equivalent to forbidding a clique of size three.

鳥(niǎo)籠

absolve

壟斷

Constructing Resilient Structures in Graphs: Rigid vs. Competitive Fault-Tolerancet-tolerant, namely, reinforcing it so that following a failure event, its surviving part continues to satisfy the requirements. The talk will distinguish between two types of fault-tolerance, termed rigid and competitive fault tolerance, compare these two notions, and illustrate them on a number of examples.

CUMB

Minimum Weighted Clique Cover on Strip-Composed Perfect Graphsat a . of a perfect strip-composed graph, with the basic graphs belonging to a class ., can be found in polynomial time, provided that the . problem can be solved on . in polynomial time. We also design a new, more efficient, combinatorial algorithm for the . problem on strip-composed claw-free perfect graphs.