The following pages link to (Q3726127):
Displaying 13 items.
- Complexity, networks, and non-uniqueness (Q301347) (← links)
- A mathematical model and a computer tool for the Tower of Hanoi and Tower of London puzzles (Q730903) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- Hemivariational inequalities on graphs (Q2140821) (← links)
- On the exponential generating function of labelled trees (Q2219985) (← links)
- Enumeration and 3D representation of the stereo-isomers of alkane molecules (Q2456599) (← links)
- Breaking the degeneracy barrier for coloring graphs with no \(K_t\) minor (Q2700634) (← links)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- From Goeritz Matrices to Quasi-alternating Links (Q3078616) (← links)
- An Intuitionistic Fuzzy Approach to the Travelling Salesman Problem (Q3297737) (← links)
- The connected graphs obtained from finite projective planes (Q5041973) (← links)
- (Q6040897) (← links)
