Pages that link to "Item:Q3105789"

The following pages link to Maximum Cardinality Simple 2-matchings in Subcubic Graphs (Q3105789):

Displaying 15 items.

• A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
• Matchability and \(k\)-maximal matchings (Q617892) (← links)
• Maximum cardinality 1-restricted simple 2-matchings (Q1010633) (← links)
• The parity Hamiltonian cycle problem (Q1690220) (← links)
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs (Q1949271) (← links)
• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges (Q2032181) (← links)
• Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
• Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
• The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
• TSP on Cubic and Subcubic Graphs (Q3009751) (← links)
• Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids (Q5067424) (← links)
• The Nonnegative Node Weight <i>j</i>-Restricted <i>k</i>-Matching Problems (Q5244876) (← links)
• Finding triangle-free 2-factors in general graphs (Q6540256) (← links)