Sciweavers

3204 search results - page 234 / 641
» The Alcuin Number of a Graph
Sort
View
DM
2007
103views more  DM 2007»
15 years 6 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
JGT
2008
77views more  JGT 2008»
15 years 6 months ago
List-coloring the square of a subcubic graph
The square G2 of a graph G is the graph with the same vertex set as G and with two vertices adjacent if their distance in G is at most 2. Thomassen showed that for a planar graph ...
Daniel W. Cranston, Seog-Jin Kim
JGT
2008
75views more  JGT 2008»
15 years 6 months ago
On two questions about circular choosability
Abstract. We answer two questions of Zhu on circular choosability of graphs. We show that the circular list chromatic number of an even cycle is equal to 2 and give an example of a...
Serguei Norine
EJC
2007
15 years 6 months ago
Hypertree width and related hypergraph invariants
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
Isolde Adler, Georg Gottlob, Martin Grohe
ICML
2006
IEEE
16 years 7 months ago
A new approach to data driven clustering
We consider the problem of clustering in its most basic form where only a local metric on the data space is given. No parametric statistical model is assumed, and the number of cl...
Arik Azran, Zoubin Ghahramani