Pages that link to "Item:Q2709795"
From MaRDI portal
The following pages link to Efficient Algorithms for Petersen's Matching Theorem (Q2709795):
Displaying 13 items.
- The cost of perfection for matchings in graphs (Q299061) (← links)
- Computing large matchings in planar graphs with fixed minimum degree (Q553342) (← links)
- Planar bus graphs (Q724233) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- An algorithm for computing simple \(k\)-factors (Q987840) (← links)
- Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces (Q1410592) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Tight bounds on maximal and maximum matchings (Q1877645) (← links)
- Positive planar satisfiability problems under 3-connectivity constraints (Q2143145) (← links)
- Breakpoint distance and PQ-trees (Q2216109) (← links)
- Deciding Relaxed Two-Colourability: A Hardness Jump (Q3557504) (← links)
- COLORING ALGORITHMS ON SUBCUBIC GRAPHS (Q5696963) (← links)
- Relating planar graph drawings to planar satisfiability problems (Q6121427) (← links)
