![](/files/happy5.png)
cubic graph
3-Decomposition Conjecture ★★★
Author(s): Arthur; Hoffmann-Ostenhof
Conjecture (3-Decomposition Conjecture) Every connected cubic graph
has a decomposition into a spanning tree, a family of cycles and a matching.
![$ G $](/files/tex/b8e7ad0330f925492bf468b5c379baec88cf1b3d.png)
Keywords: cubic graph
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
Universal Steiner triple systems ★★
Author(s): Grannell; Griggs; Knor; Skoviera
Problem Which Steiner triple systems are universal?
Keywords: cubic graph; Steiner triple system
![Syndicate content Syndicate content](/misc/feed.png)