Paper Info
Title
On the Use of Some Almost Sure Graph Properties
Abstract
This paper deals with some almost sure graph properties. A very efficient algorithm is given which yields a sample graph from the uniform distribution on the set of all connected graphs of given size n. An almost surely canonical graph labelling and an algorithm which tries to find a Hamiltonian cycle in a given graph are discussed.
Year
DOI
Venue
1980
10.1007/3-540-10291-4_9
WG
Keywords
Field
DocType
almost sure graph properties,uniform distribution,hamiltonian cycle,connected graph
Discrete mathematics,Combinatorics,Line graph,Graph property,Cubic graph,Distance-hereditary graph,Null graph,Butterfly graph,Voltage graph,Mathematics,Complement graph
Conference
ISBN
Citations 
PageRank 
3-540-10291-4
0
0.34
References 
Authors
5
1
Name
Order
Citations
PageRank
Gottfried Tinhofer111220.81