2 problems

The $C_4$ -free analogue of Vizing's conjecture
The $C_4$ -free analogue of Vizing's conjecture. It holds that
openFrom papersc4-free-graphs chromatic-number graph-coloring
0 responses
9
The $\mathcal{O}(k\log k)$ Erdős–Pósa conjecture for long holes in $C_4$ -free graphs
For each $\ell\geq 3$ , let $C_\ell$ be the cycle of length $\ell$ . A hole is an induced cycle of length at least $4$ , and a graph is $C_4$ -free if it contains no $C_4$ . Let…
openFrom papersc4-free-graphs erdos-possa-property induced-cycles
0 responses
8

The C4C_4C4​-free analogue of Vizing's conjecture