Pages that link to "Item:Q526817"
From MaRDI portal
The following pages link to Extremal anti-forcing numbers of perfect matchings of graphs (Q526817):
Displaying 18 items.
- Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
- The anti-Ramsey number of perfect matching (Q764878) (← links)
- Anti-forcing spectrum of any cata-condensed hexagonal system is continuous (Q1692699) (← links)
- Extremal hypergraphs for matching number and domination number (Q1693167) (← links)
- Forcing and anti-forcing polynomials of perfect matchings for some rectangle grids (Q1714113) (← links)
- Forcing and anti-forcing edges in bipartite graphs (Q1752588) (← links)
- Anti-forcing polynomials for benzenoid systems with forcing edges (Q1801080) (← links)
- Plane elementary bipartite graphs with forcing or anti-forcing edges (Q2000588) (← 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)
- The anti-forcing spectra of \(( 4 , 6 )\)-fullerenes (Q2139808) (← links)
- Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
- Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
- (Q4984549) (← links)
- (Q4984796) (← links)
- Computing the forcing and anti-forcing numbers of perfect matchings for graphs by integer linear programmings (Q5091506) (← links)
- Anti-forcing numbers of perfect matchings of graphs (Q5962519) (← links)
- Maximizing the minimum and maximum forcing numbers of perfect matchings of graphs (Q6073878) (← links)