Even-hole-free planar graphs have bounded treewidth (Q3503541): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bisimplicial vertices in even-hole-free graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The four-colour theorem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Quickly excluding a planar graph / rank | |||
Normal rank | |||
Latest revision as of 11:22, 28 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Even-hole-free planar graphs have bounded treewidth |
scientific article |
Statements
Even-hole-free planar graphs have bounded treewidth (English)
0 references
5 June 2008
0 references
planar graphs
0 references
even-hole-free graphs
0 references
treewidth
0 references
