Pages that link to "Item:Q2816083"
From MaRDI portal
The following pages link to Recognizing recursive circulant graphs (extended abstract) (Q2816083):
Displaying 9 items.
- The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768) (← links)
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- Maximum induced subgraph of a recursive circulant (Q1041770) (← links)
- Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
- Recognizing Knödel graphs (Q1613433) (← links)
- Circulant graphs: efficient recognizing and isomorphism testing (Q3439301) (← links)
- (Q4273666) (← links)
- (Q4890703) (← links)
- On the symmetries of some classes of recursive circulant graphs (Q5135774) (← links)