2 problems
- 0 votes0 replies1 view
The characterization of leaf powers by bad 2-cycles
Let be a strongly chordal graph, and let be its clique arrangement. A bad -cycle is a bad cycle of length in this clique ar…
- 0 votes0 replies1 view
The conjecture that is the smallest forbidden induced subgraph of leaf powers
Let be the strongly chordal graph described in the paper that is not a leaf power, and let a forbidden induced subgraph of leaf powers mean a graph that is not a leaf power b…