Paired 2-disjoint path covers of burnt pancake graphs with faulty elements

DOI10.1016/J.TCS.2023.114327arXiv2310.18831MaRDI QIDQ6138830FDOQ6138830

Authors: Tomáš Dvořák, Mei-Mei Gu 

Publication date: 16 January 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Hamiltonian pathdisjoint path coverfaulty elementsburnt pancake graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Many-to-many two-disjoint path covers in cylindrical and toroidal grids
• Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$
• Title not available (Why is that?)
• The (conditional) matching preclusion for burnt pancake graphs
• Partitions of a graph into paths with prescribed endvertices and lengths
• Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs
• Generalized Gray codes with prescribed ends
• Girth of pancake graphs
• Fault-tolerant routing in burnt pancake graphs
• Fault tolerance and diagnosability of burnt pancake networks under the comparison model
• Cycles in the burnt pancake graph
• Neighbor connectivity of pancake graphs and burnt pancake graphs

Cited In (1)

• One-to-one disjoint-path covers of leaf-sort graphs

This page was built for publication: Paired 2-disjoint path covers of burnt pancake graphs with faulty elements

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