Cutting Barnette graphs perfectly is hard (Q6589850)
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 7898962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cutting Barnette graphs perfectly is hard |
scientific article; zbMATH DE number 7898962 |
Statements
Cutting Barnette graphs perfectly is hard (English)
0 references
20 August 2024
0 references
perfect matching
0 references
cutset
0 references
perfect matching set
0 references
planar graphs
0 references
Barnette graphs
0 references
NP-Completeness
0 references
0 references
0 references
0 references
0 references
