The following pages link to Generalized planar matching (Q3357535):
Displayed 20 items.
- Combinatorial and computational aspects of graph packing and graph decomposition (Q458446) (← links)
- Induced packing of odd cycles in planar graphs (Q764360) (← links)
- An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs (Q845730) (← links)
- Forests, colorings and acyclic orientations of the square lattice (Q1306612) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- Tiling figures of the plane with two bars (Q1346250) (← links)
- Maximum tree-packing in time \(O(n^{5/2})\) (Q1391314) (← links)
- Tile invariants: New horizons. (Q1401369) (← links)
- Illuminating disjoint line segments in the plane (Q1434256) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Maximum packing for biconnected outerplanar graphs (Q1962022) (← links)
- Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- Star Partitions of Perfect Graphs (Q5167740) (← links)
- Network-Based Vertex Dissolution (Q5254088) (← links)
- Tiling with Squares and Packing Dominos in Polynomial Time (Q6051995) (← links)
- Maximum tree-packing in time O(n5/2) (Q6085700) (← links)