Cycles Intersecting Edge-Cuts of Prescribed Sizes
From MaRDI portal
Publication:3393422
Recommendations
Cited in
(18)- A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
- Cycles intersecting edge-cuts of prescribed sizes
- Small snarks with large oddness
- Circuits of length 5 in 2-factors of cubic graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- \(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski
- Hamilton cycles in 5-connected line graphs
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
- Balanced generic circuits without long paths
- Star Chromatic Index
- Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
- On dominating even subgraphs in cubic graphs
- Pairs of edges as chords and as cut-edges
- A note on antisymmetric flows in graphs
- Shorter tours and longer detours: uniform covers and a bit beyond
- The salesman's improved tours for fundamental classes
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- The fractional chromatic number of triangle-free subcubic graphs
This page was built for publication: Cycles Intersecting Edge-Cuts of Prescribed Sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3393422)