Perfect triangle-free 2-matchings

DOI10.1007/BFb0120901zbMath0457.05052OpenAlexW145550941MaRDI QIDQ3905324

William R. Pulleyblank, Cornuéjols, Gérard

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120901

zbMATH Keywords

Hamiltonian cyclepolynomial algorithmperfect triangle-free 2-matchingtriangle cluster

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Algorithms in computer science (68W99)

Related Items

Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles, Sufficient conditions for the existence of pseudo 2-factors without isolated vertices and small odd cycles, Graph factors and factorization: 1985--2003: a survey, Applying Lehman's theorems to packing problems, Induced graph packing problems, A fast scaling algorithm for the weighted triangle-free 2-matching problem, Remarks on component factors, Node based compact formulations for the Hamiltonian p‐median problem, Packing $k$-Matchings and $k$-Critical Graphs, A model for minimizing active processor time, Structural properties of matroid matchings, Dynamic matchings and quasidynamic fractional matchings. II, A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges, TRIANGLE-FREE 2-MATCHINGS REVISITED, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles