Finding triangle-free 2-factors in general graphs
From MaRDI portal
Publication:6540256
DOI10.1002/jgt.23089zbMATH Open1539.0512MaRDI QIDQ6540256
Publication date: 15 May 2024
Published in: Journal of Graph Theory (Search for Journal in Brave)
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Triangle-free 2-matchings and M-concave functions on jump systems
- An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach
- A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- A matching problem with side conditions
- Restricted \(t\)-matchings in bipartite graphs
- The theory of regular graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Matching, matroids, and extensions
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Restricted 2-factor polytopes
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Finding maximum square-free 2-matchings in bipartite graphs
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
- Finding 2-Factors Closer to TSP Tours in Cubic Graphs
- Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
- TRIANGLE-FREE 2-MATCHINGS REVISITED
- Maximum Cardinality Simple 2-matchings in Subcubic Graphs
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
- Maximum-Minimum Sätze über Graphen
- TWO THEOREMS IN GRAPH THEORY
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Restricted b-Matchings in Degree-Bounded Graphs
- Linear Systems for Constrained Matching Problems
- On Restricted Two-Factors
- Perfect triangle-free 2-matchings
- Small Travelling Salesman Polytopes
- Vertex packings: Structural properties and algorithms
- An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
- Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids
- Paths, Trees, and Flowers
- Maximum matching and a polyhedron with 0,1-vertices
- The Factorization of Linear Graphs
- On factorisation of graphs
- Reguläre Faktoren von Graphen.
- The Factors of Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Finding triangle-free 2-factors in general graphs