Pages that link to "Item:Q968154"
From MaRDI portal
The following pages link to A min-max theorem for plane bipartite graphs (Q968154):
Displaying 9 items.
- The complexity of the Clar number problem and an exact algorithm (Q1708506) (← links)
- Counting clar structures of \((4,6)\)-fullerenes (Q2008447) (← links)
- Complete forcing numbers of hexagonal systems (Q2046284) (← links)
- Complete forcing numbers of hexagonal systems. II (Q2143442) (← links)
- Single coronoid systems with an anti-forcing edge (Q2410254) (← links)
- Complete forcing numbers of graphs (Q5871599) (← links)
- Complete forcing numbers of complete and almost-complete multipartite graphs (Q6053962) (← links)
- A network flow approach to a common generalization of Clar and Fries numbers (Q6589122) (← links)
- Complete forcing numbers of \((4, 6)\)-fullerenes (Q6611038) (← links)
