Daniel C. Isaksen، نويسنده , , David P. Moulton، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1997
Pages :
5
From page :
265
To page :
269
Abstract :
A graph G is randomly planar if every planar embedding of every connected subgraph of G can be extended to a planar embedding of G. We classify these graphs.
