Coloring the vertices of a graph with majority restrictions on colors

Author： Vizing V.  

Publisher： MAIK Nauka/Interperiodica

ISSN： 1990-4789

Source： Journal of Applied and Industrial Mathematics, Vol.4, Iss.2, 2010-04, pp. : 270-275

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

COLORING SUBGRAPHS OF THE RADO GRAPH

By Sauer* N.  

Combinatorica, Vol. 26, Iss. 2, 2006-04 ,pp. : 231-253

Springer Publishing Company

Access to resources Recommend Favorite

Strategic Coloring of a Graph

By Escoffier Bruno  

Internet Mathematics, Vol. 8, Iss. 4, 2012-12 ,pp. : 424-455

Taylor & Francis Ltd

Access to resources Recommend Favorite

Coloring Vertices and Faces of Locally Planar Graphs

By Albertson Michael O.   Mohar Bojan  

Graphs and Combinatorics, Vol. 22, Iss. 3, 2006-11 ,pp. : 289-295

Springer Publishing Company

Access to resources Recommend Favorite

Coverings of the Vertices of a Graph by Small Cycles

By Forge David   Kouider Mekkia  

Graphs and Combinatorics, Vol. 23, Iss. 2, 2007-04 ,pp. : 135-143

Springer Publishing Company

Access to resources Recommend Favorite

On edge orienting methods for graph coloring

By Gendron Bernard   Hertz Alain   St-Louis Patrick  

Journal of Combinatorial Optimization, Vol. 13, Iss. 2, 2007-02 ,pp. : 163-178

Springer Publishing Company

Access to resources Recommend Favorite