17,942 research outputs found
Weak degeneracy of graphs
Motivated by the study of greedy algorithms for graph coloring, we introduce
a new graph parameter, which we call weak degeneracy. By definition, every
-degenerate graph is also weakly -degenerate. On the other hand, if
is weakly -degenerate, then (and, moreover, the same
bound holds for the list-chromatic and even the DP-chromatic number of ). It
turns out that several upper bounds in graph coloring theory can be phrased in
terms of weak degeneracy. For example, we show that planar graphs are weakly
-degenerate, which implies Thomassen's famous theorem that planar graphs are
-list-colorable. We also prove a version of Brooks's theorem for weak
degeneracy: a connected graph of maximum degree is weakly
-degenerate unless . (By contrast, all -regular
graphs have degeneracy .) We actually prove an even stronger result, namely
that for every , there is such that if is a graph
of weak degeneracy at least , then either contains a -clique or
the maximum average degree of is at least . Finally, we show
that graphs of maximum degree and either of girth at least or of
bounded chromatic number are weakly -degenerate, which
is best possible up to the value of the implied constant.Comment: 21 p
Graph colouring for office blocks
The increasing prevalence of WLAN (wireless networks) introduces the potential of electronic information leakage from one company's territory in an office block, to others due to the long-ranged nature of such communications. BAE Systems have developed a system ('stealthy wallpaper') which can block a single frequency range from being transmitted through a treated wall or ceiling to the neighbour. The problem posed to the Study Group was to investigate the maximum number of frequencies ensure the building is secure. The Study group found that this upper bound does not exist, so they were asked to find what are "good design-rules" so that an upper limit exists
Strong chromatic index of sparse graphs
A coloring of the edges of a graph is strong if each color class is an
induced matching of . The strong chromatic index of , denoted by
, is the least number of colors in a strong edge coloring
of . In this note we prove that for every -degenerate graph . This confirms the strong
version of conjecture stated recently by Chang and Narayanan [3]. Our approach
allows also to improve the upper bound from [3] for chordless graphs. We get
that for any chordless graph . Both
bounds remain valid for the list version of the strong edge coloring of these
graphs
- …