31 search results - page 1 / 7 » Improper choosability of graphs and maximum average degree |
51
Voted
JGT
2006
14 years 10 months ago
2006
85
Voted
WG
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We model a problem proposed by Alcatel, a satellite building company, using improper colourings of graphs. The relation between improper colourings and maximum average de...
SIAMDM
2008
14 years 10 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
70
Voted
DM
2010
14 years 10 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
COMBINATORICS
2006
14 years 10 months ago
2006
It is proved that, if G is a K4-minor-free graph with maximum degree 3, then G is totally 4-choosable; that is, if every element (vertex or edge) of G is assigned a list of 4 colo...