![](/files/happy5.png)
domination
Domination in cubic graphs ★★
Author(s): Reed
Problem Does every 3-connected cubic graph
satisfy
?
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ \gamma(G) \le \lceil |G|/3 \rceil $](/files/tex/56ca6c717dbe994f156838c153c99a68e2d812e8.png)
Keywords: cubic graph; domination
Domination in plane triangulations ★★
Conjecture Every sufficiently large plane triangulation
has a dominating set of size
.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
![$ \le \frac{1}{4} |V(G)| $](/files/tex/5f9f42bc03a1d128f5e02773890a16d24e450a5c.png)
Keywords: coloring; domination; multigrid; planar graph; triangulation
![Syndicate content Syndicate content](/misc/feed.png)