Titlebook: ;

ENACT

Crumple

,On Distance-, Independent Set and Other Problems in Graphs with “few” Minimal Separators, even .. The problem is NP-hard on chordal graphs for any odd .?[.]..We also provide polynomial algorithms for . and . on subclasses of . including chordal and circular-arc graphs, and we discuss variants of independent domination problems.

TSH582

Pigeon

新義

Anthrp

Yechiel Becker,Gholamreza Daraier can be computed efficiently. Furthermore, following a suggestion of Campos et al., we show that the geodetic interval number, the geodetic convexity number, the geodetic Carathéodory number, and the geodetic Radon number can all be computed in polynomial time for .-graphs.

獎(jiǎng)牌

https://doi.org/10.1007/978-94-017-2317-6dering the problem of saving colors/weight with respect to a better bound on the chromatic number. Finally, we consider the fixed parameterized tractability of Max Coloring in restricted graph classes under standard parameterization.

Epithelium

薄荷醇

NUDGE