Lower bounds on the lengths of node sequences in directed graphsGeorge MarkowskyRobert Endre Tarjan1976Discrete MathematicsPaper
An extrinsic characterization of addressable data graphsArnold L. Rosenberg1974Discrete MathematicsPaper
A majorization theorem for the number of distinct outcomes in n independent trialsC.K. WongP.C. Yue1973Discrete MathematicsPaper