Extremal H‐Colorings of Graphs with Fixed Minimum Degree

E-ISSN： 1097-0118|79|2|103-124

ISSN： 0364-9024

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

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

Extremal Problems For Transversals In Graphs With Bounded Degree

By Szabó* Tibor Tardos† Gábor

Combinatorica, Vol. 26, Iss. 3, 2006-06 ,pp. : 333-351

Springer Publishing Company

Access to resources Recommend Favorite

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs

By Li Xueliang Zang Wenan

Journal of Combinatorial Optimization, Vol. 9, Iss. 4, 2005-06 ,pp. : 331-347

Springer Publishing Company

Access to resources Recommend Favorite

Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

By Liu Bin

Graphs and Combinatorics, Vol. 26, Iss. 6, 2010-11 ,pp. : 781-791

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

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