Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 2
Izvirni znanstveni članek
Oznake: graph theory;domination;subcubic planar graph;upper bound;
Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order ▫$n$▫ is at most ▫$\lceil \frac13 n \rceil$▫, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture is false in general, but Henning and Dorbec showed that ...
Leto: 2026 Vir: Repozitorij Univerze v Ljubljani (RUL)
Izvirni znanstveni članek
Oznake: domination;subcubic planar graph;upper bound;
Since Reed conjectured in 1996 that the domination number of a connected cubic graph of order n is at most ⌈1/3n⌉, the domination number of cubic graphs has been extensively studied. It is now known that the conjecture is false in general, but Henning and Dorbec showed that it holds for graphs with ...
Leto: 2026 Vir: Repozitorij Univerze na Primorskem (RUP)
Št. zadetkov: 2
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: