On the pagenumber of trivalent Cayley graphs
DOI10.1016/J.DAM.2006.01.001zbMATH Open1092.05029OpenAlexW2107123081MaRDI QIDQ2495909FDOQ2495909
Authors: Yuuki Tanaka, Yukio Shibata 
Publication date: 30 June 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.01.001
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Title not available (Why is that?)
- Shortest routing in trivalent Cayley graph network
- Trivalent Cayley graphs for interconnection networks
- The book thickness of a graph
- Group Action Graphs and Parallel Architectures
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding iterated line digraphs in books
- Optimal layout of trivalent Cayley interconnection networks
- Hamilton cycles in Trivalent Cayley graphs
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
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.
- Pagenumber of complete bipartite graphs
- On the pagenumber of the cube-connected cycles
- On the pagenumber of the cube-connected cycles
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)
