Supereulerian Graphs and the Petersen Graph.
Paul A. CatlinHong-Jian LaiPublished in: J. Comb. Theory, Ser. B (1996)
Keyphrases
- graph representation
- graph theory
- graph structure
- weighted graph
- labeled graphs
- graph matching
- directed graph
- graph model
- graph databases
- graph mining
- graph theoretic
- graph construction
- graph properties
- graph clustering
- bipartite graph
- graph classification
- graph theoretical
- subgraph isomorphism
- graph structures
- adjacency matrix
- graph representations
- series parallel
- graph data
- graph search
- spanning tree
- evolving graphs
- graph partitioning
- disk resident
- random graphs
- reachability queries
- graph drawing
- structural pattern recognition
- graph embedding
- graph kernels
- minimum spanning tree
- average degree
- graph isomorphism
- graph edit distance
- undirected graph
- maximum clique
- inexact graph matching
- dynamic graph
- graph transformation
- attributed graphs
- connected graphs
- adjacency graph
- community discovery
- edge weights
- dense subgraphs
- small world
- directed acyclic
- maximum common subgraph
- structured data
- topological information
- planar graphs
- maximal cliques
- neighborhood graph
- social graphs
- graph layout
- web graph
- connected dominating set
- massive graphs
- relational graph
- graph patterns
- finding the shortest path
- community detection
- pattern mining
- random walk