Pages that link to "Item:Q277641"
From MaRDI portal
The following pages link to A minimax result for perfect matchings of a polyomino graph (Q277641):
Displaying 12 items.
- A maximum resonant set of polyomino graphs (Q274682) (← links)
- The monotonic diameter of the perfect matching and shortest path polytopes (Q1200757) (← links)
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- A real polynomial for bipartite graph minimum weight perfect matchings (Q2094360) (← links)
- On the Steiner hyper-Wiener index of a graph (Q2335663) (← links)
- On degree-based topological indices of random polyomino chains (Q2688570) (← links)
- Polyhedral Results for 1-Restricted Simple 2-Matchings (Q3395008) (← links)
- (Q4552202) (← links)
- Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- The polyomino graphs whose resonance graphs have a 1-degree vertex (Q6585545) (← links)