On dispersability of some circulant graphs

DOI10.7155/jgaa.v28i1.2941zbMATH Open1548.05176MaRDI QIDQ6616230

Samuel S. Joslin, Shannon Overbay, Paul C. Kainen

Publication date: 8 October 2024

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

circulant graphsbook thicknessdispersability

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The book thickness of a graph
• A survey on multi-loop networks.
• On dispersability of some products of cycles
• Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes
• Dense networks that do not synchronize and sparse ones that do
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• On dispersable book embeddings
• On the dispersability of odd toroidal grids

This page was built for publication: On dispersability of some circulant graphs