Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

28

DM
2000

favoriteEmaildiscussreport

82views more DM 2000»

On special numberings of hypergraphs

13 years 10 months ago

On special numberings of hypergraphs

Download web.thu.edu.tw

Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple

Günter Schaar

Real-time Traffic

Arbitrarily Large | DM 2000 | Egyptian Edge-numbering | Vertex-simple ÿnite Hypergraph |

claim paper

Related Content

» Finding and counting cliques and independent sets in runiform hypergraphs

» Circular Chromatic Number of Hypergraphs

» Colouring Planar Mixed Hypergraphs

» CPerfect KUniform Hypergraphs

» The chromatic numbers of random hypergraphs

» Multilevel Hypergraph Partitioning Application in VLSI Domain

» Probabilistic graph and hypergraph matching

» 3Uniform hypergraphs of bounded degree have linear Ramsey numbers

» On the chromatic number and independence number of hypergraph products

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2000
Where	DM
Authors	Günter Schaar

Comments (0)