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

ISSN： 0911-0119

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

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

Related content

An Extremal Problem on Contractible Edges in 3-Connected Graphs

By Anderson Joe Wu Haidong

Graphs and Combinatorics, Vol. 22, Iss. 2, 2006-06 ,pp. : 145-152

Springer Publishing Company

Access to resources Recommend Favorite

Largest connected component of a star graph with faulty vertices

By Yang Xiaofan

International Journal of Computer Mathematics, Vol. 85, Iss. 12, 2008-12 ,pp. : 1771-1778

Taylor & Francis Ltd

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

Removable Edges in Longest Cycles of 4-Connected Graphs

By Wu Jichang Li Xueliang

Graphs and Combinatorics, Vol. 20, Iss. 3, 2004-08 ,pp. : 413-422

Springer Publishing Company

Access to resources Recommend Favorite

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

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

John Wiley & Sons Inc

Access to resources Recommend Favorite