Titlebook: ;

斜谷

https://doi.org/10.1007/978-1-4615-0221-0anners of size .(log .), where . is the diameter of .,.– interval graphs have a 1-spanner with fewer than 2. – 2 edges..Furthermore, at the end of the paper we state other results on collective tree c-spanners for . > 1 and other more general graph classes.

Bumble

Modern Trends in Applied Terrestrial Ecologys, and for planar line graphs. Now, the computational complexity of the stable cutset problem restricted to claw-free graphs and claw-free planar graphs is known for all bounds on the maximum degree..Moreover, we prove that the stable cutset problem remains .-complete for ..-free planar graphs of maximum degree five.

Dna262

倫理學

遣返回國

CAGE

Roman Domination over Some Graph Classesumber of an interval graph can be computed in linear time. We also show that the Roman domination number of a cograph can be computed in linear time. Besides, we show that there are polynomial time algorithms for computing the Roman domination numbers of AT-free graphs and graphs with a .-octopus.

猛擊

詩集

軌道

corn732