Sciweavers

3268 search results - page 110 / 654
» The hub number of a graph
Sort
View
JCT
2011
83views more  JCT 2011»
15 years 1 months ago
Sandpile groups and spanning trees of directed line graphs
Abstract. We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associa...
Lionel Levine
COMPGEOM
2003
ACM
15 years 11 months ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...
SODA
2004
ACM
160views Algorithms» more  SODA 2004»
15 years 7 months ago
On colorings of squares of outerplanar graphs
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...
Geir Agnarsson, Magnús M. Halldórsso...
JCT
2010
112views more  JCT 2010»
15 years 4 months ago
More on block intersection polynomials and new applications to graphs and block designs
The concept of intersection numbers of order r for t-designs is generalized to graphs and to block designs which are not necessarily t-designs. These intersection numbers satisfy ...
Leonard H. Soicher
ICANNGA
2007
Springer
141views Algorithms» more  ICANNGA 2007»
16 years 17 days ago
On Sum Coloring of Graphs with Parallel Genetic Algorithms
Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
Zbigniew Kokosinski, Krzysztof Kwarciany