Necessary edges in \(k\)-chordalisations of graphs (Q1417852): Difference between revisions
From MaRDI portal
Changed an Item |
Add wikidata reference. |
||
| (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.1023/a:1027320705349 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2135382359 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59567885 / rank | |||
Normal rank | |||
Latest revision as of 04:37, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Necessary edges in \(k\)-chordalisations of graphs |
scientific article |
Statements
Necessary edges in \(k\)-chordalisations of graphs (English)
0 references
6 January 2004
0 references
graph algorithms
0 references
chordal graphs
0 references
triangulated graphs
0 references
treewidth
0 references
interval graphs
0 references
pathwidth
0 references
