The following pages link to (Q4047574):
Displaying 3 items.
- Lower bounds for the clique and the chromatic numbers of a graph (Q790829) (← links)
- An upper bound for the number of spanning trees of a graph (Q1234299) (← links)
- Some methods for counting the spanning trees in labelled molecular graphs, examined in relation to certain fullerenes (Q1917322) (← links)
