References
- LeisersonC., Area efficient graph layouts for VLSI Proc. 21st Ann IEEE Symp. FOCS1980 270–281
- IyerA.V.RatliffH.D.VijayanG., On an edge ranking problem of trees and graphs Discrete Appl. Math. 30 1 1991 43–52
- IyerA.V.RatliffH.D.VijayanG., Optimal node ranking of trees Inform. Process. Lett. 28 5 1988 225–229
- BodlaenderH.L.DeogunJ.S.JansenK.KloksT.KratschD.MüllerH.TuzaZ., Rankings of graphs Graph-Theoretic Concepts in Computer Science (Herrsching, 1994)Lecture Notes in Comput. Sci. vol. 9031995SpringerBerlin292–304
- GhoshalJ.LaskarR.PilloneD., Minimal rankings Networks 28 1 1996 45–53
- AlpertH., Rank numbers of grid graphs Discrete Math. 310 23 2010 3324–3333
- BlakeB.FieldE.JacobJ., Rank numbers of graphs that are combinations of paths and cycles Involve A J. Math. 6 3 2013 369–381
- BruothE.HorňákM., On-line ranking number for cycles and paths Discuss. Math. Graph Theory 19 2 1999 175–197The Seventh Workshop “3in1” Graphs ’98 (Krynica)
- DereniowskiD.NadolskiA., Vertex rankings of chordal graphs and weighted trees Inform. Process. Lett. 98 3 2006 96–100
- HsiehS., On vertex ranking of a starlike graph Inform. Process. Lett. 82 3 2002 131–135
- NovotnyS.OrtizJ.NarayanD.A., Minimal k-rankings and the rank number of Pn2 Inform. Process. Lett. 109 3 2009 193–198
- OrtizJ.ZemkeA.KingH.NarayanD.HorňákM., Minimal k-rankings for prism graphs Involve 3 2 2010 183–190
- RichterP.LevenE.TranA.EkB.JacobJ.NarayanD.A., Rank numbers for bent ladders Discuss. Math. Graph Theory 34 2 2014 309–329
- SergelE.RichterP.TranA.CurranP.JacobJ.NarayanD.A., Rank numbers for some trees and unicyclic graphs Aequationes Math. 82 1–2 2011 65–79
- JacobB.C.JacobJ., lp-Optimal rankings and max-optimal rankings are different Graphs Combin. 33 6 2017 1473–1483