Sciweavers

723 search results - page 20 / 145
» On the hyperbolicity constant in graphs
Sort
View
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
COMBINATORICA
1998
77views more  COMBINATORICA 1998»
15 years 5 months ago
A Bound on the Total Chromatic Number
We prove that the total chromatic number of any graph with maximum degree is at most plus an absolute constant. In particular, we show that for su ciently large, the total chromat...
Michael Molloy, Bruce A. Reed
GD
1998
Springer
15 years 10 months ago
Drawing Large Graphs with H3Viewer and Site Manager
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
Tamara Munzner
JCT
2008
65views more  JCT 2008»
15 years 6 months ago
Random graphs on surfaces
Counting labelled planar graphs, and typical properties of random labelled planar graphs, have received much attention recently. We start the process here of extending these invest...
Colin McDiarmid
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 10 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken