Maximum cutwidth problem for graphs. (Q1413710): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11766-003-0030-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2086403669 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3097395 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4870352 / rank | |||
Normal rank | |||
Latest revision as of 12:33, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum cutwidth problem for graphs. |
scientific article |
Statements
Maximum cutwidth problem for graphs. (English)
0 references
17 November 2003
0 references
The paper establishes bounds on the size of a connected graph of given order and cutwidth. Certain extremal configurations are exhibited.
0 references
cutwidth
0 references
extremal graph
0 references
0 references
