Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/151006111 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2347101962 / rank | |||
Normal rank | |||
Revision as of 22:38, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time |
scientific article |
Statements
Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (English)
0 references
9 May 2016
0 references
\(t\)-perfect graphs
0 references
claw-free graphs
0 references
induced minors
0 references
