A lower bound on the order of the largest induced linear forest in triangle-free planar graphs (Q1727766): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1705.11133 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum induced forests of planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4137202 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum induced forests in graphs of bounded treewidth / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3971782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum induced linear forests in outerplanar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the linear vertex-arboricity of a planar graph / rank | |||
Normal rank | |||
Latest revision as of 09:10, 18 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
