Pages that link to "Item:Q861006"

The following pages link to Unimodularity of the Clar number problem (Q861006):

Displaying 18 items.

• A maximum resonant set of polyomino graphs (Q274682) (← links)
• A minimax result for perfect matchings of a polyomino graph (Q277641) (← links)
• A combination of Clar number and Kekulé count as an indicator of relative stability of fullerene isomers of \(\text C_{60}\) (Q609604) (← links)
• On the Clar number of graphene fragment (Q830854) (← links)
• The Clar formulas of a benzenoid system and the resonance graph (Q967298) (← links)
• A min-max theorem for plane bipartite graphs (Q968154) (← links)
• Maximum cardinality resonant sets and maximal alternating sets of hexagonal systems (Q980378) (← links)
• The complexity of the Clar number problem and an exact algorithm (Q1708506) (← links)
• Counterexamples to a proposed algorithm for fries structures of benzenoids (Q1930506) (← links)
• Counting clar structures of \((4,6)\)-fullerenes (Q2008447) (← links)
• Some tight bounds on the minimum and maximum forcing numbers of graphs (Q2097177) (← links)
• Some novel minimax results for perfect matchings of hexagonal systems (Q2166259) (← links)
• Clar structures vs Fries structures in hexagonal systems (Q2318231) (← links)
• Packing resonant hexagons in fullerenes (Q2339827) (← 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)
• A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)