138 research outputs found
Star 5-edge-colorings of subcubic multigraphs
The star chromatic index of a multigraph , denoted , is the
minimum number of colors needed to properly color the edges of such that no
path or cycle of length four is bi-colored. A multigraph is star
-edge-colorable if . Dvo\v{r}\'ak, Mohar and \v{S}\'amal
[Star chromatic index, J Graph Theory 72 (2013), 313--326] proved that every
subcubic multigraph is star -edge-colorable, and conjectured that every
subcubic multigraph should be star -edge-colorable. Kerdjoudj, Kostochka and
Raspaud considered the list version of this problem for simple graphs and
proved that every subcubic graph with maximum average degree less than is
star list--edge-colorable. It is known that a graph with maximum average
degree is not necessarily star -edge-colorable. In this paper, we
prove that every subcubic multigraph with maximum average degree less than
is star -edge-colorable.Comment: to appear in Discrete Mathematics. arXiv admin note: text overlap
with arXiv:1701.0410
An upper bound on the fractional chromatic number of triangle-free subcubic graphs
An -coloring of a graph is a function which maps the vertices
of into -element subsets of some set of size in such a way that
is disjoint from for every two adjacent vertices and in
. The fractional chromatic number is the infimum of over
all pairs of positive integers such that has an -coloring.
Heckman and Thomas conjectured that the fractional chromatic number of every
triangle-free graph of maximum degree at most three is at most 2.8. Hatami
and Zhu proved that . Lu and Peng improved
the bound to . Recently, Ferguson, Kaiser
and Kr\'{a}l' proved that . In this paper,
we prove that
Packing chromatic vertex-critical graphs
The packing chromatic number of a graph is the smallest
integer such that the vertex set of can be partitioned into sets ,
, where vertices in are pairwise at distance at least .
Packing chromatic vertex-critical graphs, -critical for short, are
introduced as the graphs for which
holds for every vertex of . If , then is
--critical. It is shown that if is -critical,
then the set can be almost
arbitrary. The --critical graphs are characterized, and
--critical graphs are characterized in the case when they
contain a cycle of length at least which is not congruent to modulo
. It is shown that for every integer there exists a
--critical tree and that a --critical
caterpillar exists if and only if . Cartesian products are also
considered and in particular it is proved that if and are
vertex-transitive graphs and , then is -critical
- β¦