NP-completeness results for some problems on subclasses of bipartite and chordal graphs (Q995581)
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: NP-completeness results for some problems on subclasses of bipartite and chordal graphs |
scientific article; zbMATH DE number 5186620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness results for some problems on subclasses of bipartite and chordal graphs |
scientific article; zbMATH DE number 5186620 |
Statements
NP-completeness results for some problems on subclasses of bipartite and chordal graphs (English)
0 references
3 September 2007
0 references
harmonious coloring
0 references
pair-complete coloring
0 references
\(k\)-path partition
0 references
bipartite permutation graphs
0 references
convex graphs
0 references
quasi-threshold graphs
0 references
threshold graphs
0 references
NP-completeness
0 references
0 references
0.838901698589325
0 references
0.8351778388023376
0 references
0.8045704364776611
0 references
0.8026497960090637
0 references
