Decomposing Graphs of High Minimum Degree into 4‐Cycles

E-ISSN： 1097-0118|79|3|167-177

ISSN： 0364-9024

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

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

Long cycles in random subgraphs of graphs with large minimum degree

RANDOM STRUCTURES AND ALGORITHMS, Vol. 45, Iss. 4, 2014-12 ,pp. : 764-767

John Wiley & Sons Inc

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

Extremal H‐Colorings of Graphs with Fixed Minimum Degree

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 2, 2015-06 ,pp. : 103-124

John Wiley & Sons Inc

Access to resources Recommend Favorite