The following pages link to On embeddings of circulant graphs (Q2346467):
Displaying 6 items.
- The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic (Q1999743) (← links)
- Finite cubic graphs admitting a cyclic group of automorphism with at most three orbits on vertices (Q2214042) (← links)
- A practical algorithm for the computation of the genus (Q5037919) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
- Cubic vertex-transitive graphs admitting automorphisms of large order (Q6173900) (← links)
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians (Q6184481) (← links)
