On 3-edge-connected supereulerian graphs in graph family C(l, k).
Xiaomin LiDengxin LiHong-Jian LaiPublished in: Discret. Math. (2010)
Keyphrases
- weighted graph
- undirected graph
- connected graphs
- edge weights
- connected components
- directed graph
- vertex set
- graph structure
- adjacency matrix
- neighborhood graph
- graph representation
- graph theory
- labeled graphs
- graph model
- graph partitioning
- graph matching
- graph construction
- strongly connected
- graph structures
- graph clustering
- subgraph isomorphism
- graph databases
- spanning tree
- real world graphs
- graph properties
- graph mining
- graph search
- graph isomorphism
- graph classification
- densely connected
- random graphs
- graph theoretic
- disjoint paths
- minimum spanning tree
- shortest path
- graph data
- adjacency graph
- series parallel
- directed acyclic graph
- bipartite graph
- average degree
- special case
- reachability queries
- connected dominating set
- graph representations
- graph theoretical
- approximation algorithms
- equivalence class
- evolving graphs
- complex networks
- dynamic graph
- graph kernels
- graph transformation
- frequent subgraphs
- bounded treewidth
- planar graphs
- maximum independent set
- maximum common subgraph
- inexact graph matching
- random walk
- edge detection
- maximum cardinality
- structural pattern recognition
- dense subgraphs
- bounded degree
- social graphs
- maximal cliques
- attributed graphs