منابع مشابه
Injective colorings of sparse graphs
Let mad(G) denote the maximum average degree (over all subgraphs) of G and let χi(G) denote the injective chromatic number of G. We prove that if mad(G) ≤ 5 2 , then χi(G) ≤ ∆(G) + 1; and if mad(G) < 42 19 , then χi(G) = ∆(G). Suppose that G is a planar graph with girth g(G) and ∆(G) ≥ 4. We prove that if g(G) ≥ 9, then χi(G) ≤ ∆(G) + 1; similarly, if g(G) ≥ 13, then χi(G) = ∆(G).
متن کاملInjective Colorings with Arithmetic Constraints
An injective coloring of a graph is a vertex labeling such that two vertices sharing a common neighbor get different labels. In this work we introduce and study what we call additive colorings. An injective coloring c : V (G) → Z of a graph G is an additive coloring if for every uv, vw in E(G), c(u)+ c(w) = 2c(v). The smallest integer k such that an injective (resp. additive) coloring of a give...
متن کاملBreaking Variable Symmetry in Almost Injective Problems
Lexicographic constraints are commonly used to break variable symmetries. In the general case, the number of constraint to be posted is potentially exponential in the number of variables. For injective problems (AllDiff), Puget’s method[11] breaks all variable symmetries with a linear number of constraints. In this paper we assess the number of constraints for “almost” injective problems. We pr...
متن کاملA Note on Almost Injective Modules
We give some new properties of almost injective modules and their endomorphism rings, and also provide conditions as to when a direct sum of almost injective (or CS) modules is again almost injective (or CS) in some special cases..
متن کاملInjective colorings of planar graphs with few colors
An injective coloring of a graph is a vertex coloring where two vertices have distinct colors if a path of length two exists between them. In this paper some results on injective colorings of planar graphs with few colors are presented. We show that all planar graphs of girth ≥19 and maximum degree ∆ are injectively ∆-colorable. We also show that all planar graphs of girth ≥10 are injectively (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2019
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.2071