Computing and Combinatorics
From MaRDI portal
Publication:4681201
DOI10.1007/B99243zbMath1091.68080OpenAlexW2491887524MaRDI QIDQ4681201
Publication date: 15 June 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99243
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (7)
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ Fault tolerance of hypercube like networks: spanning laceability under edge faults ⋮ Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements ⋮ The 1-fixed-endpoint path cover problem is Polynomial on interval graphs ⋮ The two-equal-disjoint path cover problem of matching composition network ⋮ One-to-many node-disjoint paths in \((n,k)\)-star graphs ⋮ A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs
This page was built for publication: Computing and Combinatorics
