Maximum Order of Triangle‐Free Graphs with a Given Rank

E-ISSN： 1097-0118|79|2|145-158

ISSN： 0364-9024

Source： JOURNAL OF GRAPH THEORY, Vol.79, Iss.2, 2015-06, pp. : 145-158

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 minimum balanced bipartitions of triangle-free graphs

By Li Haiyan Liang Yanting Liu Muhuo Xu Baogang

Journal of Combinatorial Optimization, Vol. 27, Iss. 3, 2014-04 ,pp. : 557-566

Springer Publishing Company

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

Triply Existentially Complete Triangle‐Free Graphs

JOURNAL OF GRAPH THEORY, Vol. 78, Iss. 4, 2015-04 ,pp. : 305-317

John Wiley & Sons Inc

Access to resources Recommend Favorite

Dynamic choosability of triangle‐free graphs and sparse random graphs

JOURNAL OF GRAPH THEORY, Vol. 87, Iss. 3, 2018-03 ,pp. : 347-355

John Wiley & Sons Inc

Access to resources Recommend Favorite

K ₄-free graphs without large induced triangle-free subgraphs

By Wolfovitz Guy

Combinatorica, Vol. 33, Iss. 5, 2013-10 ,pp. : 623-631

Springer Publishing Company

Access to resources Recommend Favorite