Recommendations
Cites work
- 2-linked graphs
- A Polynomial Solution to the Undirected Two Paths Problem
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Disjoint paths in graphs
- Eine Verallgemeinerung des n-fachen Zusammenhangs für Graphen
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3494318 (Why is no real title available?)
- Proof of Toft's conjecture: Every graph containing no fully odd K₄ is 3-colorable
- Totally odd K₄-subdivisions in 4-chromatic graphs
- Triples in matroid circuits
Cited in
(4)
This page was built for publication: Bonds with parity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q414634)