Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs.
R. RajarajachozhanR. SampathkumarPublished in: AKCE Int. J. Graphs Comb. (2019)
Keyphrases
- graph theory
- graph representation
- structural learning
- weighted graph
- graph construction
- graph structure
- directed graph
- labeled graphs
- graph theoretic
- graph classification
- graph matching
- graph mining
- graph databases
- graph model
- graph theoretical
- graph partitioning
- graph clustering
- graph search
- random graphs
- spanning tree
- adjacency matrix
- bipartite graph
- graph properties
- graph structures
- undirected graph
- series parallel
- subgraph isomorphism
- reachability queries
- graph data
- structural pattern recognition
- average degree
- tree decomposition
- graph drawing
- random walk
- graph kernels
- graph transformation
- directed acyclic graph
- maximum common subgraph
- graph representations
- strongly connected components
- minimum spanning tree
- topological information
- directed acyclic
- edge weights
- adjacency graph
- real world graphs
- graph isomorphism
- graph embedding
- bounded treewidth
- disk resident
- quasi cliques
- maximum cardinality
- evolving graphs
- finding the shortest path
- connected graphs
- inexact graph matching
- connected dominating set
- hyper graph
- maximum clique
- query graph
- vertex set
- planar graphs
- polynomial time complexity
- social graphs
- bounded degree
- graph layout
- social networks
- maximal cliques
- community discovery
- decomposition method
- small world
- structured data
- np complete