A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (Q1727766)
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 lower bound on the order of the largest induced linear forest in triangle-free planar graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on the order of the largest induced linear forest in triangle-free planar graphs |
scientific article |
Statements
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (English)
0 references
20 February 2019
0 references
planar graphs
0 references
induced subgraph
0 references
linear forest
0 references
triangle free
0 references
0.912199079990387
0 references
0.905593991279602
0 references
0.8790085911750793
0 references
0.873239278793335
0 references
0.8723156452178955
0 references
