Cycles Intersecting Edge-Cuts of Prescribed Sizes
DOI10.1137/070683635zbMATH Open1229.05174OpenAlexW2253259020MaRDI QIDQ3393422FDOQ3393422
Authors: Tomáš Kaiser, Riste Škrekovski 
Publication date: 20 August 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/501f2dfaebb535a029aa3785626d15f10d334bd0
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
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
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Circuits of length 5 in 2-factors of cubic graphs
- \(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski
- Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
- Hamilton cycles in 5-connected line graphs
- 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)
