\(k\)-NLC graphs and polynomial algorithms (Q1336631): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(k\)-NLC graphs and polynomial algorithms |
scientific article |
Statements
\(k\)-NLC graphs and polynomial algorithms (English)
0 references
3 November 1994
0 references
\(k\)-node label controlled graphs
0 references
simple max-cut problem
0 references
Hamiltonian circuit property
0 references
