perfect graph
graph whose maximum clique’s size equals the chromatic number
Facts
3 properties- Instance of
- χ-bounded graph class, intersection class of graphs, self-complementary graph class[2][3]
- Studied by
- graph theory[6]
🏷️ Also known as
en Berge graph
en perfect graph
ar بيان تام
de Perfekte Graphen
de perfekter Graph
es Grafo perfecto
fa گراف کامل
fr graphe parfait
he גרף מושלם
hu perfekt gráf
it grafo perfetto
ja パーフェクトグラフ
ko 완벽 그래프
nl perfecte graaf
pl Graf Berge
pl graf doskonały
pt grafo perfeito
ro graf perfect
ru граф Берже
ru совершенный граф
🔖 Identifiers · 13
- Library of Congress Authorities ID
- sh85099790
- OpenAlex ID
- C32972407
- BNCF Thesaurus ID
- 57123
- Bibliothèque nationale de France ID
- 12396031j
- Freebase ID
- /m/031hx5
- J9U entity ID
- 987007536193405171
- MathWorld ID
- PerfectGraph
- Microsoft Academic ID (discontinued)
- 32972407
- ProofWiki ID
- Definition:Perfect_Graph
- Topic's main category
- Category:Perfect graphs
- Wolfram Language entity code
- Entity["GraphClass", "Perfect"]
Show all 13 identifiers +1
- Yale LUX ID
- concept/51212f29-3d5c-40cf-95bb-d060e61f72dc
🔗 Connections
← Statement describes 2
Maintained by WikiProject 1
Studied by 1
Subtypes 1
Topic's main category 1
← Category's main topic 1
Press Enter · cited answer in seconds
0 sources
Summary
perfect graph is a χ-bounded graph class[1].