Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model. Retrieved May 24, 2026, from https://4ort.xyz/entity/paired-2-disjoint-path-covers-of-k-ary-n-cubes-under-the-partitioned-edge-fault-model
MLA“Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/paired-2-disjoint-path-covers-of-k-ary-n-cubes-under-the-partitioned-edge-fault-model.
BibTeX@misc{4ortxyz_paired-2-disjoint-path-covers-of-k-ary-n-cubes-under-the-partitioned-edge-fault-model_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model}}, year = {2026}, url = {https://4ort.xyz/entity/paired-2-disjoint-path-covers-of-k-ary-n-cubes-under-the-partitioned-edge-fault-model}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model — https://4ort.xyz/entity/paired-2-disjoint-path-covers-of-k-ary-n-cubes-under-the-partitioned-edge-fault-model (retrieved 2026-05-24)