Reduction for 3-Connected Graphs of Minimum Degree at Least Four

ISSN： 0911-0119

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

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

Minimum-segment convex drawings of 3-connected cubic plane graphs

By Mondal Debajyoti

Journal of Combinatorial Optimization, Vol. 25, Iss. 3, 2013-04 ,pp. : 460-480

Springer Publishing Company

Access to resources Recommend Favorite

An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three

RANDOM STRUCTURES AND ALGORITHMS, Vol. 47, Iss. 1, 2015-08 ,pp. : 73-98

John Wiley & Sons Inc

Access to resources Recommend Favorite

On The Structure Of Triangle-Free Graphs Of Large Minimum Degree

By Łuczak* Tomasz

Combinatorica, Vol. 26, Iss. 4, 2006-08 ,pp. : 489-493

Springer Publishing Company

Access to resources Recommend Favorite

Simultaneous stratification and domination in graphs with minimum degree two

By Henning Michael A. Maritz J.E.

Quaestiones Mathematicae, Vol. 29, Iss. 3, 2006-09 ,pp. : 313-328

Taylor & Francis Ltd

Access to resources Recommend Favorite

Decomposing Graphs of High Minimum Degree into 4‐Cycles

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. : 167-177

John Wiley & Sons Inc

Access to resources Recommend Favorite