\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (Q436601): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2012.04.003 / rank | |||
| Property / cites work | |||
| Property / cites work: Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2012.04.003 / rank | |||
Normal rank | |||
Latest revision as of 17:32, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs |
scientific article |
Statements
\(L(2,1)\)-labeling of dually chordal graphs and strongly orderable graphs (English)
0 references
25 July 2012
0 references
\(L(2, 1)\)-labeling
0 references
strongly orderable graphs
0 references
dually chordal graphs
0 references
chordal bipartite graphs
0 references
graph algorithms
0 references
approximation algorithms
0 references
0 references
