Titlebook: ;

Osmosis

Exhaustive Generation of ,-Critical ,-Free Graphs,only finitely many 4-critical .-free graphs, for both . and .. We also show that there are only finitely many 4-critical .-free graphs. For each case of these cases we also give the complete lists of critical graphs and vertex-critical graphs. These results generalize previous work by Hell and Huang

Demulcent

Crumple

ONYM

Eccentricity Approximating Trees,al graph admits an eccentricity 2-approximating spanning tree. That is, every chordal graph . has a spanning tree . such that . for every vertex ., where . (.) is the eccentricity of a vertex . in . (in ., respectively). Using only metric properties of graphs, we extend that result to a much larger

潜移默化

Carcinoma

Vertex Cover Structural Parameterization Revisited,uch that . is a pseudoforest. We show that . admits a polynomial kernel being parameterized by the size of the pseudoforest modulator. In other words, we provide a polynomial time algorithm that for an input graph . and integer ., outputs a graph . and integer ., such that . has . vertices and . has

NIB

angina-pectoris

是剥皮

notice

Almost Induced Matching: Linear Kernels and Parameterized Algorithms, vertex of degree 1. This paper studies parameterized algorithms for this problem by taking the size of deletion set . as the parameter. By using the techniques of finding maximal 3-path packings and an extended crown decomposition, we obtain the first linear vertex kernel for this problem, improvin