Pages that link to "Item:Q2519019"

The following pages link to Even factors, jump systems, and discrete convexity (Q2519019):

Displaying 12 items.

• Triangle-free 2-matchings and M-concave functions on jump systems (Q401132) (← links)
• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
• A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs (Q429657) (← links)
• A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
• An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs (Q448969) (← links)
• Improved algorithms for even factors and square-free simple \(b\)-matchings (Q1934309) (← links)
• A note on M-convex functions on jump systems (Q2217499) (← links)
• A weighted independent even factor algorithm (Q2429469) (← links)
• Recent Developments in Discrete Convex Analysis (Q2971611) (← links)
• A survey of fundamental operations on discrete convex functions of various kinds (Q4999337) (← links)
• On basic operations related to network induction of discrete convex functions (Q4999338) (← links)
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)