Bonds with parity constraints
From MaRDI portal
Publication:414634
DOI10.1016/J.JCTB.2011.08.005zbMATH Open1241.05063OpenAlexW2092072604MaRDI QIDQ414634FDOQ414634
Authors: Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang
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
Recommendations
Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Paths and cycles (05C38) Connectivity (05C40)
Cites Work
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A Polynomial Solution to the Undirected Two Paths Problem
- Disjoint paths in graphs
- 2-linked graphs
- Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
- Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
- Title not available (Why is that?)
- Triples in matroid circuits
- Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable
- Totally odd \(K_4\)-subdivisions in 4-chromatic graphs
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)