Parity systems and the delta-matroid intersection problem.
Maxmaxflow and counting subgraphs.
Some remarks on Jaeger's dual-hamiltonian conjecture
François Jaeger conjectured in 1974 that every cyclically 4-connected cubic graph is dual hamiltonian, that is to say the vertices of can be partitioned into two subsets such that each subset induces a tree in . We shall make several remarks on this conjecture.
Page 1