The giant component threshold for random regular graphs with edge faults H. Prodinger

By Goerdt A.  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 307-321

Elsevier

Access to resources Recommend Favorite

Random regular graphs with edge faults: Expansion through cores

By Goerdt A.  

Theoretical Computer Science, Vol. 264, Iss. 1, 2001-08 ,pp. : 91-125

Elsevier

Access to resources Recommend Favorite

On the Embedding of a Class of Regular Graphs in a Faulty Hypercube

By Tseng Y.C.   Lai T.H.  

Journal of Parallel and Distributed Computing, Vol. 37, Iss. 2, 1996-09 ,pp. : 200-206

Academic Press

Access to resources Recommend Favorite

Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems

By Kant G.   Xin H.  

Theoretical Computer Science, Vol. 172, Iss. 1, 1997-02 ,pp. : 175-193

Elsevier

Access to resources Recommend Favorite

On edge-colouring indifference graphs

By de Figueiredo C.M.H.   Meidanis J.   de Mello C.P.  

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 91-106

Elsevier

Access to resources Recommend Favorite