On the pagenumber of trivalent Cayley graphs
From MaRDI portal
Publication:2495909
Recommendations
Cites work
- scientific article; zbMATH DE number 1054728 (Why is no real title available?)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- Embedding iterated line digraphs in books
- Group Action Graphs and Parallel Architectures
- Hamilton cycles in Trivalent Cayley graphs
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Optimal layout of trivalent Cayley interconnection networks
- Shortest routing in trivalent Cayley graph network
- The book thickness of a graph
- Trivalent Cayley graphs for interconnection networks
Cited in
(7)- Optimal layout of trivalent Cayley interconnection networks
- A survey on book-embedding of planar graphs
- The pagenumber of toroidal graphs is at most seven
- On the page number of triple-loop networks with even cardinality.
- On the pagenumber of the cube-connected cycles
- On the pagenumber of the cube-connected cycles
- Pagenumber of complete bipartite graphs
This page was built for publication: On the pagenumber of trivalent Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2495909)