Minimal rankings

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199608)28:1<45::AID-NET6>3.0.CO;2-D" /><45::AID-NET6>3.0.CO;2-D 10.1002/(SICI)1097-0037(199608)28:1<45::AID-NET6>3.0.CO;2-DzbMath0863.05071OpenAlexW4246577058MaRDI QIDQ5689817

Jayati Ghoshal, D. Pillone, Renu C. Laskar

Publication date: 10 June 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199608)28:1<45::aid-net6>3.0.co;2-d

zbMATH Keywords

chromatic numberachromatic numberranking numberrank numberlabelminimal rankingsrankings of graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (14)

A lower bound for on-line ranking number of a path ⋮ Greedy algorithms for generalized \(k\)-rankings of paths ⋮ Maximizing the number of edges in optimal \(k\)-rankings ⋮ \(l_p\)-optimal rankings and max-optimal rankings are different ⋮ Arankings of trees ⋮ Rank numbers for bent ladders ⋮ Graphs with large rank numbers and rank numbers of subdivided stars ⋮ Minimal \(k\)-rankings and the rank number of \(P^2_n\) ⋮ Rank numbers of grid graphs ⋮ Minimal rankings and the arank number of a path ⋮ Rank numbers for some trees and unicyclic graphs ⋮ Greedy rankings and arank numbers ⋮ Max-optimal and sum-optimal labelings of graphs ⋮ Ranking numbers of graphs

This page was built for publication: Minimal rankings