scientific article; zbMATH DE number 1342133

zbMath0948.90142MaRDI QIDQ4263715

David B. Hartvigsen

Publication date: 22 September 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial time algorithmundirected graphTutte type theorems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Combinatorial algorithms for matchings, even factors and square-free 2-factors ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs ⋮ Restricted \(t\)-matchings in bipartite graphs ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Finding maximum square-free 2-matchings in bipartite graphs ⋮ Approximating the longest paths in grid graphs ⋮ Restricted b‐factors in bipartite graphs and t‐designs ⋮ Packing paths of length at least two ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles