Characterization of interval graphs that are paired 2-disjoint path coverable
- 22 August 2022
- journal article
- research article
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 79 (3) , 2783-2800
Abstract
No abstract availableKeywords
Funding Information
- National Research Foundation of Korea (2021R1F1A1048180)
This publication has 22 references indexed in Scilit:
- Paired 2-disjoint path covers of multi-dimensional torus networks with 2n− 3 faulty edgesTheoretical Computer Science, 2017
- Ore-type degree conditions for disjoint path covers in simple graphsDiscrete Mathematics, 2016
- Sampling automata and programsTheoretical Computer Science, 2015
- Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval GraphsJournal of Graph Theory, 2014
- The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval GraphsAlgorithmica, 2009
- Many-to-Many Disjoint Path Covers in the Presence of Faulty ElementsIEEE Transactions on Computers, 2008
- Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elementsIEEE Transactions on Parallel and Distributed Systems, 2006
- 1-Tough cocomparability graphs are hamiltonianDiscrete Mathematics, 1997
- On Path Cover Problems in Digraphs and Applications to Program TestingIEEE Transactions on Software Engineering, 1979
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964