Cycles and paths
From Egres Open
(Redirected from Category:Cycles and paths)
This page will contain a survey of open problems related to cycles and paths.
Problems in this category:
- Berge's conjecture on path partitions
- Caccetta-Häggkvist conjecture
- Changing conservative weightings in bipartite graphs
- Compatible Euler-tours
- Edge-disjoint spanning trees and paths
- Min-sum two edge-disjoint paths
- Node disjoint circuits in Eulerian digraphs
- Orientation with shortest round trip
- Recognition of Seymour graphs
- Sabidussi's compatibility conjecture
