Uncountable graphs with all their vertices in one face

Author： Boza Luis   Fedriani Eugenio M.   Núńez Juan  

Publisher： Springer Publishing Company

ISSN： 0236-5294

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

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

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

Graph Designs for all Graphs with Six Vertices and Eight Edges

By Kang Qing-de   Yuan Lan-dang   Liu Shu-xia  

Acta Mathematicae Applicatae Sinica, Vol. 21, Iss. 3, 2005-08 ,pp. : 469-484

Springer Publishing Company

Access to resources Recommend Favorite

A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence

By Cooper Colin   Radzik Tomasz   Siantos Yiannis  

Internet Mathematics, Vol. 10, Iss. 1-2, 2014-04 ,pp. : 137-161

Taylor & Francis Ltd

Access to resources Recommend Favorite

Intriguing Sets of Vertices of Regular Graphs

By De Bruyn Bart  

Graphs and Combinatorics, Vol. 26, Iss. 5, 2010-09 ,pp. : 629-646

Springer Publishing Company

Access to resources Recommend Favorite