Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (Q6143874)
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 7794342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition |
scientific article; zbMATH DE number 7794342 |
Statements
Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition (English)
0 references
24 January 2024
0 references
vertex partition
0 references
planar graph
0 references
forest
0 references
cycle
0 references
discharging method
0 references
0 references
0.8944917917251587
0 references
0.8893717527389526
0 references
0.8863561153411865
0 references
0.8376237750053406
0 references
0.8310057520866394
0 references
