Results 1  10
of
146
On generalized Kneser hypergraph colorings
, 2006
"... In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sS, “generalized runiform Kneser hypergraphs with intersection multiplicities s. ” It generalized previous lower bounds by Kˇríˇz (1992/2000) for the case s = (1,...,1) without intersection mul ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs KGr sS, “generalized runiform Kneser hypergraphs with intersection multiplicities s. ” It generalized previous lower bounds by Kˇríˇz (1992/2000) for the case s = (1,...,1) without intersection
The Graphs of Häggkvist and Hell
, 2008
"... This thesis investigates Häggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of these graphs are given. We begin with an examination of the transitivity and ..."
Abstract
 Add to MetaCart
This thesis investigates Häggkvist & Hell graphs. These graphs are an extension of the idea of Kneser graphs, and as such share many attributes with them. A variety of original results on many different properties of these graphs are given. We begin with an examination of the transitivity
On k–Chromatically Connected Graphs
"... A graph G is chromatically k–connected if every vertex cutset induces a subgraph with chromatic number at least k. Thus, in particular each neighborhood has to induce a k–chromatic subgraph. In [3], Godsil, Nowakowski and Nešetřil asked whether there exists a k–chromatically connected graph such ..."
Abstract
 Add to MetaCart
in which every vertex neighborhood induces a subgraph with a given girth. Key words: chromatic connectivity, Kneser graphs 1
On Dynamic Coloring of Graphs
, 2009
"... A dynamic coloring of a graph G is a proper coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. In this paper we present some upper bounds for the dynamic chromatic number of graphs. In this regard, we shall show that there is a constant ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
A dynamic coloring of a graph G is a proper coloring such that for every vertex v ∈ V (G) of degree at least 2, the neighbors of v receive at least 2 colors. In this paper we present some upper bounds for the dynamic chromatic number of graphs. In this regard, we shall show that there is a constant
HYPERGRAPH PARTITIONING BASED MODELS AND METHODS FOR EXPLOITING CACHE LOCALITY IN SPARSE MATRIXVECTOR MULTIPLICATION
, 2013
"... Sparse matrixvector multiplication (SpMxV) is a kernel operation widely used in iterative linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers. Matrices with irregular sparsity patterns make it difficult to utilize cache locality effectively in SpMxV c ..."
Abstract
 Add to MetaCart
partitioning. We utilize the columnnet hypergraph model for the 1D method and enhance the rowcolumnnet hypergraph model for the 2D method. The primary aim in both of the proposed methods is to maximize the exploitation of temporal locality in accessing input vector entries. The multipleSpMxV framework
Recent progress in graph pebbling
 Graph Theory Notes N. Y
"... The subject of graph pebbling has seen dramatic growth recently, both in the number of publications and in the breadth of variations and applications. Here we update the reader on the many developments that have occurred since the original Survey of Graph Pebbling in 1999. 2 1 ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
The subject of graph pebbling has seen dramatic growth recently, both in the number of publications and in the breadth of variations and applications. Here we update the reader on the many developments that have occurred since the original Survey of Graph Pebbling in 1999. 2 1
On rdynamic Coloring of Graphs
, 2014
"... An rdynamic proper kcoloring of a graph G is a proper kcoloring of G such that every vertex in V (G) has neighbors in at least min{d(v), r} different color classes. The rdynamic chromatic number of a graph G, written χr(G), is the least k such that G has such a coloring. By a greedy coloring alg ..."
Abstract
 Add to MetaCart
An rdynamic proper kcoloring of a graph G is a proper kcoloring of G such that every vertex in V (G) has neighbors in at least min{d(v), r} different color classes. The rdynamic chromatic number of a graph G, written χr(G), is the least k such that G has such a coloring. By a greedy coloring
Graph imperfection and channel assignment
"... Given a graph G and a nonnegative integer weight or demand xv for each node v, a colouring of the pair (G, x) is an assignment to each node v of a set of xv colours such that adjacent nodes receive disjoint sets of colours. We are interested in such colourings when the maximum demand xv is large. A ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Given a graph G and a nonnegative integer weight or demand xv for each node v, a colouring of the pair (G, x) is an assignment to each node v of a set of xv colours such that adjacent nodes receive disjoint sets of colours. We are interested in such colourings when the maximum demand xv is large
Results 1  10
of
146