Finding triangle-free 2-factors in general graphs

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

Paths, Trees, and Flowers
The Factorization of Linear Graphs
Combinatorial optimization. Polyhedra and efficiency (3 volumes)
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
Title not available (Why is that?)
Maximum matching and a polyhedron with 0,1-vertices
Maximum-Minimum Sätze über Graphen
Vertex packings: Structural properties and algorithms
Finding 2-factors closer to TSP tours in cubic graphs
TWO THEOREMS IN GRAPH THEORY
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
Linear Systems for Constrained Matching Problems
A Short Proof of the Factor Theorem for Finite Graphs
The Factors of Graphs
A matching problem with side conditions
Restricted $t$-matchings in bipartite graphs
Matching, matroids, and extensions
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
On factorisation of graphs
Finding maximum square-free 2-matchings in bipartite graphs
A Weighted k_{t, t}-Free t-Factor Algorithm for Bipartite Graphs
On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
Combinatorial algorithms for matchings, even factors and square-free 2-factors
Polyhedron of triangle-free simple 2-matchings in subcubic graphs
Maximum Cardinality Simple 2-matchings in Subcubic Graphs
Restricted b-Matchings in Degree-Bounded Graphs
Perfect triangle-free 2-matchings
Small Travelling Salesman Polytopes
Restricted 2-factor polytopes
Reguläre Faktoren von Graphen.
On Restricted Two-Factors
The theory of regular graphs
TRIANGLE-FREE 2-MATCHINGS REVISITED
Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
Improved algorithms for even factors and square-free simple $b$-matchings
Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs
Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids

This page was built for publication: Finding triangle-free 2-factors in general graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6540256)