Pages that link to "Item:Q2714908"
From MaRDI portal
The following pages link to Embedding longest fault-free paths in arrangement graphs with faulty vertices (Q2714908):
Displaying 7 items.
- Conditional matching preclusion for the arrangement graphs (Q653318) (← links)
- Longest fault-free paths in hypercubes with vertex faults (Q819312) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs. (Q1426221) (← links)
- The paths embedding of the arrangement graphs with prescribed vertices in given position (Q1928512) (← links)
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
- Linearly many faults in arrangement graphs (Q5326794) (← links)