Bonds with parity constraints
From MaRDI portal
Publication:414634
DOI10.1016/j.jctb.2011.08.005zbMath1241.05063OpenAlexW2092072604MaRDI QIDQ414634
Guoli Ding, Xingxing Yu, Wenan Zang, Xu-jin Chen
Publication date: 11 May 2012
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2011.08.005
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Flows in graphs (05C21)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Triples in matroid circuits
- Disjoint paths in graphs
- 2-linked graphs
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- A Polynomial Solution to the Undirected Two Paths Problem
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs