Pages that link to "Item:Q6073878"
From MaRDI portal
The following pages link to Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878):
Displaying 13 items.
- A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
- The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice (Q283197) (← links)
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- Bounds on the forcing numbers of bipartite graphs (Q817753) (← links)
- Forcing numbers of stop signs. (Q1401374) (← links)
- Global forcing number for maximal matchings (Q1690248) (← links)
- The minimum forcing number of perfect matchings in the hypercube (Q1727779) (← links)
- On the forced matching numbers of bipartite graphs (Q1827691) (← links)
- On the forcing matching numbers of prisms of graphs (Q2075509) (← links)
- Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
- (Q4984549) (← links)
- (Q4984796) (← links)
- Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506) (← links)