Cover time of a random graph with a degree sequence II: Allowing vertices of degree two

E-ISSN： 1098-2418|45|4|627-674

ISSN： 1042-9832

Source： RANDOM STRUCTURES AND ALGORITHMS, Vol.45, Iss.4, 2014-12, pp. : 627-674

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

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

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

A Spanning Tree with High Degree Vertices

By Ozeki Kenta Yamashita Tomoki

Graphs and Combinatorics, Vol. 26, Iss. 4, 2010-07 ,pp. : 591-596

Springer Publishing Company

Access to resources Recommend Favorite

On the character degree graph of solvable groups. II. Discon- nected graphs

By Pálfy P. P.

Studia Scientiarum Mathematicarum Hungarica, Vol. 38, Iss. 1-4, 2001-12 ,pp. : 339-355

Akademiai Kiado

Access to resources Recommend Favorite

Connectedness strength of two vertices in an uncertain graph

By Zhang Bo

International Journal of Computer Mathematics, Vol. 90, Iss. 2, 2013-02 ,pp. : 246-257

Taylor & Francis Ltd

Access to resources Recommend Favorite