A degree condition for the circumference of a graph.
Nathaniel DeanPierre FraissePublished in: J. Graph Theory (1989)
Keyphrases
- directed graph
- sufficient conditions
- graph theory
- graph model
- directed acyclic graph
- degree distribution
- graph representation
- graph mining
- weighted graph
- bipartite graph
- graph matching
- connected components
- random graphs
- random walk
- graph theoretical
- data sets
- graph theoretic
- minimum spanning tree
- graphical representation
- clustering coefficient
- graph structure
- spanning tree
- database
- ranking algorithm
- structured data
- social networks
- genetic algorithm
- real time