The following pages link to Paths, Trees, and Flowers (Q5341586):
Displaying 21 items.
- Reconstructing polygons from scanner data (Q553352) (← links)
- Nash-solvable two-person symmetric cycle game forms (Q642972) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Pairwise kidney exchange (Q813943) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Matching is as easy as matrix inversion (Q1095658) (← links)
- On maximal independent sets of vertices in claw-free graphs (Q1139605) (← links)
- Minimum cost perfect matching with delays for two sources (Q1628601) (← links)
- Some Ore-type results for matching and perfect matching in \(k\)-uniform hypergraphs (Q1633862) (← links)
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists (Q1736596) (← links)
- The lattice dimension of a graph (Q1775025) (← links)
- Exact algorithms for edge domination (Q1945174) (← links)
- Large rainbow matchings in general graphs (Q2422240) (← links)
- Combinatorics and algorithms for augmenting graphs (Q2631076) (← links)
- Karp–Sipser on Random Graphs with a Fixed Degree Sequence (Q3103622) (← links)
- On Perfect Matchings and Tilings in Uniform Hypergraphs (Q4638614) (← links)
- Matching, Euler tours and the Chinese postman (Q4766817) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- Parameterized shifted combinatorial optimization (Q5915595) (← links)
