The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs

E-ISSN： 1469-2163|26|4|525-535

ISSN： 0963-5483

Source： Combinatorics, Probability & Computing, Vol.26, Iss.4, 2017-07, pp. : 525-535

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 the Maximum Number of Edges in Topological Graphs with no Four Pairwise Crossing Edges

By Ackerman Eyal

Discrete & Computational Geometry, Vol. 41, Iss. 3, 2009-04 ,pp. : 365-375

Springer Publishing Company

Access to resources Recommend Favorite

Semi-regular graphs of minimum independence number

By Nelson P. Radcliffe A.J.

Discrete Mathematics, Vol. 275, Iss. 1, 2004-01 ,pp. : 237-263

Elsevier

Access to resources Recommend Favorite

The existence of even regular factors of regular graphs on the number of cut edges

By Fan Hong Liu Gui Liu Ji Long He

Acta Mathematica Sinica, Vol. 26, Iss. 12, 2010-12 ,pp. : 2305-2312

Springer Publishing Company

Access to resources Recommend Favorite

BINDING NUMBER AND MINIMUM DEGREE FOR FRACTIONAL (k,m)-DELETED GRAPHS

Bulletin of the Australian Mathematical Society, Vol. 85, Iss. 1, 2011-10 ,pp. : 60-67

Cambridge University Press

Access to resources Recommend Favorite

Splitting and contractible edges in 4-connected graphs

By Saito A.

Journal of Combinatorial Theory, Series B, Vol. 88, Iss. 2, 2003-07 ,pp. : 227-235

Elsevier

Access to resources Recommend Favorite