Vertex-Distinguishing Edge Colorings of Graphs with Degree Sum Conditions

ISSN： 0911-0119

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

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 adjacent vertex distinguishing edge colourings of graphs

By Liu Bin Liu Guizhen

International Journal of Computer Mathematics, Vol. 87, Iss. 4, 2010-03 ,pp. : 726-732

Taylor & Francis Ltd

Access to resources Recommend Favorite

On the adjacent vertex-distinguishing total chromatic numbers of the graphs with ∆ (G) = 3

By Wang Haiying

Journal of Combinatorial Optimization, Vol. 14, Iss. 1, 2007-07 ,pp. : 87-109

Springer Publishing Company

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

d-strong Edge Colorings of Graphs

By Kemnitz Arnfried Marangio Massimiliano

Graphs and Combinatorics, Vol. 30, Iss. 1, 2014-01 ,pp. : 183-195

Springer Publishing Company

Access to resources Recommend Favorite

Edge Colorings and Circular Flow Numbers of Regular Graphs

JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 1, 2015-05 ,pp. : 1-7

John Wiley & Sons Inc

Access to resources Recommend Favorite