Pages that link to "Item:Q1727779"
From MaRDI portal
The following pages link to The minimum forcing number of perfect matchings in the hypercube (Q1727779):
Displaying 16 items.
- The number of perfect matchings in a hypercube (Q580373) (← links)
- The minimum forcing number for the torus and hypercube (Q1348133) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- On the forcing matching numbers of prisms of graphs (Q2075509) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- Continuous forcing spectrum of regular hexagonal polyhexes (Q2139775) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Global forcing number for maximal matchings in corona products (Q2172838) (← links)
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) (Q2684050) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- On a leverage problem in the hypercube (Q4014610) (← links)
- Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)
- Extra Connectivity and Structure Connectivity of 2-Dimensional Torus Networks (Q6114863) (← links)
- Revisiting semistrong edge‐coloring of graphs (Q6199384) (← links)