Graph polynomials and group coloring of graphs.
Bartlomiej BosekJaroslaw GrytczukGrzegorz GutowskiOriol SerraMariusz ZajacPublished in: Eur. J. Comb. (2022)
Keyphrases
- graph theory
- graph representation
- graph structure
- directed graph
- graph matching
- graph databases
- labeled graphs
- graph theoretic
- weighted graph
- graph mining
- graph construction
- graph partitioning
- adjacency matrix
- graph theoretical
- graph model
- graph structures
- graph search
- graph clustering
- graph classification
- graph properties
- series parallel
- bipartite graph
- graph data
- random graphs
- graph isomorphism
- spanning tree
- dynamic graph
- subgraph isomorphism
- graph kernels
- undirected graph
- reachability queries
- query graph
- structural pattern recognition
- maximum cardinality
- connected graphs
- maximum common subgraph
- graph transformation
- graph drawing
- inexact graph matching
- average degree
- real world graphs
- connected dominating set
- graph edit distance
- random walk
- attributed graphs
- planar graphs
- minimum spanning tree
- connected components
- graph representations
- dense subgraphs
- graph patterns
- massive graphs
- neighborhood graph
- social graphs
- edge weights
- independent set
- adjacency graph
- structured data
- directed acyclic graph
- finding the shortest path
- small world
- maximum independent set
- spectral decomposition
- proximity graph
- fully connected
- graph embedding
- maximum clique
- graph layout
- vertex set
- frequent subgraphs
- community discovery
- maximal cliques
- bounded treewidth
- shortest path