4 problems
- 0 votes0 replies0 views
Theo-Conjecture for bridgeless cubic graphs
Theo-Conjecture.
- 0 votes0 replies0 views
Theo-Conjecture for claw-free graphs
Let be a claw-free graph, meaning that contains no induced copy of . Let and denote its ordinary and zombie damage…
- 0 votes0 replies0 views
Theo-Conjecture for chordal graphs
Let be a chordal graph, and let and denote its ordinary and zombie damage numbers. Let be its connected dominatio…
- 0 votes0 replies1 view
Theo-Conjecture for connected cographs
Let ) be a connected cograph with no universal vertex. For the co-components and defined as in Proposition, Theo-Conjecture. … The cograph condition is essen…