The following pages link to Computing and Combinatorics (Q4681201):
Displaying 11 items.
- Disjoint path covers in recursive circulants \(G(2^m,4)\) with faulty elements (Q638530) (← links)
- The two-equal-disjoint path cover problem of matching composition network (Q963388) (← links)
- One-to-many node-disjoint paths in \((n,k)\)-star graphs (Q968113) (← links)
- A linear-time algorithm for finding a one-to-many 3-disjoint path cover in the cube of a connected graph (Q1628689) (← links)
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- Fault tolerance of hypercube like networks: spanning laceability under edge faults (Q2192380) (← links)
- A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
- Disjoint path covers with path length constraints in restricted hypercube-like graphs (Q2402363) (← links)
- Degree sequence conditions for a graph to be disjoint path coverable (Q2696615) (← links)
- Algorithms and Computation (Q5712162) (← links)
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530) (← links)
