Pages that link to "Item:Q1708506"
From MaRDI portal
The following pages link to The complexity of the Clar number problem and an exact algorithm (Q1708506):
Displaying 4 items.
- Computing bond orders in molecule graphs (Q631782) (← links)
- Unimodularity of the Clar number problem (Q861006) (← links)
- How constraint programming can help chemists to generate benzenoid structures and assess the local aromaticity of benzenoids (Q2079271) (← links)
- A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)