On dispersability of some products of cycles

DOI10.35834/2021/3302206zbMATH Open1485.05061arXiv2108.11839OpenAlexW3215051024MaRDI QIDQ2116698FDOQ2116698

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

Publication date: 18 March 2022

Published in: Missouri Journal of Mathematical Sciences (Search for Journal in Brave)

Abstract: We show that the matching book thickness of the Cartesian product of two odd-length cycle-graphs is five if at least one of the cycles has length 3 or 5.

Full work available at URL: https://arxiv.org/abs/2108.11839

zbMATH Keywords

chromatic indexdispersable graphmatching book thickness

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• The book thickness of a graph
• Bounded-degree graphs have arbitrarily large geometric thickness
• On the chromatic index of outerplanar graphs
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Title not available (Why is that?)
• Complexity of products of even cycles
• On dispersability of some products of cycles
• On dispersable book embeddings

Cited In (7)

• On dispersability of some products of cycles
• Note on cyclic sequences in the product rate variation problem
• A survey on book-embedding of planar graphs
• On dispersability of some circulant graphs
• The matching book embeddings of pseudo-Halin graphs
• On the dispersability of odd toroidal grids
• Cyclic products and optimal traps in cyclic birth and death chains

This page was built for publication: On dispersability of some products of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2116698)