Paired 2-disjoint path cover of burnt pancake graphs with n − 3 faulty elements
Authors:
- Congzhen ChenCCCongzhen Chen
- Pingshan LiPLPingshan Li
- Xianglin LiuXLXianglin Liu
- 21 October 2025
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 307-325
Abstract
No abstract availableFunding Information
- National Natural Science Foundation of China (12301453)
- Natural Science Foundation of Hunan Province (2021JJ40522)
- Education Department of Hunan Province (23B0125, 22B0180)
- Higher Education Discipline Innovation Project (D23017)
- Department of Science and Technology of Hunan Province (2018WK4006)
This publication has 16 references indexed in Scilit:
- Paired 2-disjoint path covers of burnt pancake graphs with faulty elementsTheoretical Computer Science, 2023
- Characterization of interval graphs that are paired 2-disjoint path coverableThe Journal of Supercomputing, 2022
- The unpaired many-to-many k-disjoint paths in bipartite hypercube-like networksTheoretical Computer Science, 2022
- Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphsDiscrete Applied Mathematics, 2020
- Generalized Gray codes with prescribed endsTheoretical Computer Science, 2017
- The (conditional) matching preclusion for burnt pancake graphsDiscrete Applied Mathematics, 2013
- Girth of pancake graphsDiscrete Applied Mathematics, 2011
- Fault-tolerant routing in burnt pancake graphsInformation Processing Letters, 2010
- The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAlgorithmica, 2009
- Bounds for sorting by prefix reversalDiscrete Mathematics, 1979