Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree

ISSN： 1439-8516

Source： Acta Mathematica Sinica, Vol.30, Iss.4, 2014-04, pp. : 703-709

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

Related content

Trimmed Moebius Inversion and Graphs of Bounded Degree

By Björklund Andreas

Theory of Computing Systems, Vol. 47, Iss. 3, 2010-10 ,pp. : 637-654

Springer Publishing Company

Access to resources Recommend Favorite

Polychromatic Colorings of Plane Graphs

By Alon Noga Berke Robert Buchin Kevin Buchin Maike Csorba Péter Shannigrahi Saswata Speckmann Bettina Zumstein Philipp

Discrete & Computational Geometry, Vol. 42, Iss. 3, 2009-10 ,pp. : 421-442

Springer Publishing Company

Access to resources Recommend Favorite

Commutative Rings Whose Cozero-Divisor Graphs are Unicyclic or of Bounded Degree

By Akbari S. Khojasteh S.

Communications in Algebra, Vol. 42, Iss. 4, 2014-04 ,pp. : 1594-1605

Taylor & Francis Ltd

Access to resources Recommend Favorite

On maximum matchings in cubic graphs with a bounded number of bridge-covering paths

Bulletin of the Australian Mathematical Society, Vol. 36, Iss. 3, 1987-12 ,pp. : 441-447

Cambridge University Press

Access to resources Recommend Favorite

On sparse graphs with given colorings and homomorphisms

By Nesetril J. Zhu X.

Journal of Combinatorial Theory, Series B, Vol. 90, Iss. 1, 2004-01 ,pp. : 161-172

Elsevier

Access to resources Recommend Favorite