1 problem
Generalized Hamilton-connectedness conjecture. Every -connected -free split graph of order at least is Hamilton-connected.
Generalized Hamilton-connectedness conjecture. Every -connected -free split graph of order at least is Hamilton-connected.