Minor embedding in broken chimera and derived graphs is NP-complete
Research article (Theoretical Computer Science, 2023) · cited 15× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Minor embedding in broken chimera and derived graphs is NP-complete — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
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.
APA
4ort.xyz Knowledge Graph. (2026). Minor embedding in broken chimera and derived graphs is NP-complete. Retrieved May 24, 2026, from https://4ort.xyz/entity/minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete
MLA
“Minor embedding in broken chimera and derived graphs is NP-complete.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete.
BibTeX
@misc{4ortxyz_minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Minor embedding in broken chimera and derived graphs is NP-complete}}, year = {2026}, url = {https://4ort.xyz/entity/minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Minor embedding in broken chimera and derived graphs is NP-complete — https://4ort.xyz/entity/minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/minor-embedding-in-broken-chimera-and-derived-graphs-is-np-complete · Last refreshed: