Amanote Research

Amanote Research

    RegisterSign In

Nonrepetitive Colorings of Graphs

Electronic Notes in Discrete Mathematics - Netherlands
doi 10.1016/j.endm.2005.06.077
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsApplied MathematicsDiscrete Mathematics
Date

October 1, 2005

Authors
Noga AlonJarosław Grytczuk
Publisher

Elsevier BV


Related search

Generalized Total Colorings of Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2011English

Strong Edge Colorings of Uniform Graphs

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2004English

On Imbeddings and Colorings of Graphs. II

Proceedings of the Japan Academy
1967English

On Imbeddings and Colorings of Graphs. I

Proceedings of the Japan Academy
1967English

M_{2}-Edge Colorings of Dense Graphs

Opuscula Mathematica
Mathematics
2016English

Erratum To: Vertex-Distinguishing E-Total Colorings of Graphs

Arabian Journal for Science and Engineering
Multidisciplinary
2011English

Perfect 3-Colorings of the Cubic Graphs of Order 10

Electronic Journal of Graph Theory and Applications
CombinatoricsApplied MathematicsDiscrete Mathematics
2017English

The Lower Bounds of the Interval Edge-Colorings of Infinite Bicyclic Graphs

Advances in Applied Mathematics
2017English

Facial Nonrepetitive Graph Colourings

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy