Home › Entities › general › strongly perfect graph

strongly perfect graph

graph for which every induced subgraph H has an independent set meeting all maximal cliques of H
Thing general Q136231915
Press Enter · cited answer in seconds

strongly perfect graph

Summary

Key Facts

  • strongly perfect graph's subclass of is recorded as perfect graph[1].
  • strongly perfect graph's MathWorld ID is recorded as StronglyPerfectGraph[2].
  • strongly perfect graph's Wolfram Language entity code is recorded as Entity["GraphClass", "StronglyPerfect"][3].
  • strongly perfect graph's graphclasses.org ID is recorded as gc_267[4].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [1] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [3] ↑ . wikidata.org.
  4. [4] ↑ . wikidata.org.

📑 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). strongly perfect graph. Retrieved May 7, 2026, from https://4ort.xyz/entity/strongly-perfect-graph
MLA “strongly perfect graph.” 4ort.xyz Knowledge Graph, 4ort.xyz, 7 May. 2026, https://4ort.xyz/entity/strongly-perfect-graph.
BibTeX @misc{4ortxyz_strongly-perfect-graph_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{strongly perfect graph}}, year = {2026}, url = {https://4ort.xyz/entity/strongly-perfect-graph}, note = {Accessed: 2026-05-07}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): strongly perfect graph — https://4ort.xyz/entity/strongly-perfect-graph (retrieved 2026-05-07)

Canonical URL: https://4ort.xyz/entity/strongly-perfect-graph · Last refreshed: