Embedding Cartesian product of some graphs in books
From MaRDI portal
Recommendations
Cited in
(16)- Embedding connected double-loop networks with even cardinality in books
- On the page number of lexicographic product of paths and cycles in books
- Embedding connected double-loop networks with odd cardinality in books
- Embedding generalized Petersen graph in books
- Embedding semistrong product of paths and cycles in books
- Embedding the Myceilski of a graph and the amalgamation of two graphs in pages
- Book embedding of graph bundles over a cycle with claw as a fibre
- scientific article; zbMATH DE number 7478527 (Why is no real title available?)
- Matching book thickness of generalized Petersen graphs
- Book embedding of Möbius cubes.
- Embedding Cartesian product of n paths and n cycles in books
- scientific article; zbMATH DE number 4185630 (Why is no real title available?)
- The matching book embeddings of pseudo-Halin graphs
- Using Euler’s Formula to Find the Lower Bound of the Page Number
- The dispersability of the Kronecker cover of the product of complete graphs and cycles
- Deques on a torus
This page was built for publication: Embedding Cartesian product of some graphs in books
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5381219)