Cycles Intersecting Edge-Cuts of Prescribed Sizes

DOI10.1137/070683635MaRDI QIDQ3393422zbMATH OpenOpenAlexFDO

Authors Tomáš Kaiser, Riste Škrekovski

Publication date 20 August 2009

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://semanticscholar.org/paper/501f2dfaebb535a029aa3785626d15f10d334bd0

zbMATH Keywords

coverable setdominating cycleedge-cutgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Cycles intersecting edge-cuts of prescribed sizes
• scientific article; zbMATH DE number 1790882
• Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
• Short cycle covers on cubic graphs by choosing a 2-factor
• Integer flows and cycle covers

Cited in

(19)

• A note on antisymmetric flows in graphs
• Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
• Cyclic cutwidths of the two-dimensional ordinary and cylindrical meshes
• Shorter tours and longer detours: uniform covers and a bit beyond
• The salesman's improved tours for fundamental classes
• Small snarks with large oddness
• The fractional chromatic number of triangle-free subcubic graphs
• A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs
• Cycles intersecting edge-cuts of prescribed sizes
• Hamilton cycles in 5-connected line graphs
• Circuits of length 5 in 2-factors of cubic graphs
• Balanced generic circuits without long paths
• Pairs of edges as chords and as cut-edges
• Star Chromatic Index
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
• \(\{4,5\}\) is not coverable: a counterexample to a conjecture of Kaiser and Škrekovski
• On dominating even subgraphs in cubic graphs
• Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
• Non-conflicting no-where zero Z₂ Z₂-flows in cubic 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)