Related content

Uncountable graphs with all their vertices in one face

By Boza Luis   Fedriani Eugenio M.   Núńez Juan  

Acta Mathematica Hungarica, Vol. 112, Iss. 4, 2006-09 ,pp. : 307-313

Springer Publishing Company

Access to resources Recommend Favorite

Contractible Edges in a 4-Connected Graph with Vertices of Degree Greater Than Four

By Ando Kiyoshi   Egawa Yoshimi  

Graphs and Combinatorics, Vol. 23, Iss. 1, 2007-06 ,pp. : 99-115

Springer Publishing Company

Access to resources Recommend Favorite

On graphs in which all neighborhoods of vertices are locally pseudocyclic graphs

By Kabanov V.   Makhnev A.  

Doklady Mathematics, Vol. 89, Iss. 1, 2014-01 ,pp. : 76-79

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Optimal Sequential and Parallel Algorithms to Compute All Cut Vertices on Trapezoid Graphs

By Hota Mrinmoy   Pal Madhumangal   Pal Tapan K.  

Computational Optimization and Applications, Vol. 27, Iss. 1, 2004-01 ,pp. : 95-113

Springer Publishing Company

Access to resources Recommend Favorite

All Pairs Shortest Distances for Graphs with Small Integer Length Edges

By Galil Z.   Margalit O.  

Information and Computation, Vol. 134, Iss. 2, 1997-05 ,pp. : 103-139

Academic Press

Access to resources Recommend Favorite