Clique-perfectness and balancedness of some graph classes (Q2931952)
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: Clique-perfectness and balancedness of some graph classes |
scientific article; zbMATH DE number 6375000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique-perfectness and balancedness of some graph classes |
scientific article; zbMATH DE number 6375000 |
Statements
Clique-perfectness and balancedness of some graph classes (English)
0 references
28 November 2014
0 references
balanced graphs
0 references
clique-perfect graphs
0 references
diamond-free graphs
0 references
\(P_{4}\)-tidy graphs
0 references
paw-free graphs
0 references
recognition algorithms
0 references
0 references
0 references
0.8305644989013672
0 references
0.8135964870452881
0 references
0.8124311566352844
0 references
0.8099033832550049
0 references
0.8089374303817749
0 references
