On dispersability of some products of cycles

DOI10.35834/2021/3302206MaRDI QIDQ2116698zbMATH OpenOpenAlexFDO

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

Publication date 18 March 2022

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

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)

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.

Cites work

• scientific article; zbMATH DE number 15256 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Bounded-degree graphs have arbitrarily large geometric thickness
• Comparing Queues and Stacks As Machines for Laying Out Graphs
• Complexity of products of even cycles
• On dispersability of some products of cycles
• On the chromatic index of outerplanar graphs
• The book thickness of a graph

Cited in

(7)

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

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)