Pages that link to "Item:Q968177"

The following pages link to Forcing matching numbers of fullerene graphs (Q968177):

Displaying 22 items.

• The maximum forcing number of cylindrical grid, toroidal 4-8 lattice and Klein bottle 4-8 lattice (Q283197) (← links)
• Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
• Complete forcing numbers of primitive coronoids (Q328729) (← links)
• Anti-forcing spectra of perfect matchings of graphs (Q511717) (← links)
• Extremal anti-forcing numbers of perfect matchings of graphs (Q526817) (← links)
• On forcing matching number of boron-nitrogen fullerene graphs (Q642986) (← links)
• Anti-forcing spectrum of any cata-condensed hexagonal system is continuous (Q1692699) (← links)
• Distance-restricted matching extendability of fullerene graphs (Q1708507) (← links)
• Forcing and anti-forcing edges in bipartite graphs (Q1752588) (← links)
• Continuous forcing spectra of even polygonal chains (Q2025175) (← links)
• A mathematical programming model for computing the fries number of a fullerene (Q2282646) (← links)
• Complete forcing numbers of catacondensed hexagonal systems (Q2344000) (← links)
• Single coronoid systems with an anti-forcing edge (Q2410254) (← links)
• On the maximum forcing and anti-forcing numbers of \((4, 6)\)-fullerenes (Q2410263) (← links)
• Characterizing the fullerene graphs with the minimum forcing number 3 (Q2656966) (← links)
• Forcing and anti-forcing polynomials of a type of polyomino graphs (Q2687507) (← links)
• The forcing edge covering number of a graph (Q2892108) (← links)
• Anti-forcing number of some specific graphs (Q4617716) (← links)
• On the anti-Kekulé problem of cubic graphs (Q5198031) (← links)
• Fullerenes with the maximum Clar number (Q5962516) (← 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)