Maximum regular induced subgraphs in \(2P_3\)-free graphs (Q690473)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6110697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum regular induced subgraphs in \(2P_3\)-free graphs |
scientific article; zbMATH DE number 6110697 |
Statements
Maximum regular induced subgraphs in \(2P_3\)-free graphs (English)
0 references
27 November 2012
0 references
independent set
0 references
clique
0 references
induced matching
0 references
regular induced subgraph
0 references
polynomial-time algorithm
0 references
\(2P_{3}\)-free graphs
0 references
0 references
0 references
0 references
0 references
0.8861441016197205
0 references
0.834039568901062
0 references
0.80963134765625
0 references
0.8035197257995605
0 references
0.8014889359474182
0 references
