A new class of perfect Hoàng graphs (Q1901048)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new class of perfect Hoàng graphs |
scientific article; zbMATH DE number 810271
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new class of perfect Hoàng graphs |
scientific article; zbMATH DE number 810271 |
Statements
A new class of perfect Hoàng graphs (English)
0 references
3 December 1995
0 references
A Hoàng graph \(G\) is a graph whose edges may be colored with two colours. \textit{C. T. Hoàng} [J. Graph Theory 19, No. 2, 271-279 (1995; Zbl 0820.05025)] conjectured that these graphs are perfect and proved two partial results concerning their perfectness. In this paper, a Hoàng graph is said to be reducible if it does not contain as an induced subgraph any of the graphs in a four-member family of graphs of order 6 described here, and it is proved that for reducible Hoàng graphs this conjecture is true.
0 references
perfect graph
0 references
Raspail graph
0 references
Hoàng graph
0 references
reducible Hoàng graphs
0 references
0.7793346643447876
0 references
0.7663819789886475
0 references
0.7627950310707092
0 references
0.7627950310707092
0 references
0.7588063478469849
0 references
