Graph polynomials and paintability of plane graphs.
Jaroslaw GrytczukStanislav Jendrol'Mariusz ZajacPublished in: Discret. Appl. Math. (2022)
Keyphrases
- graph theory
- graph representation
- graph structure
- graph matching
- graph databases
- graph theoretic
- directed graph
- graph construction
- graph mining
- labeled graphs
- graph clustering
- weighted graph
- adjacency matrix
- graph model
- graph structures
- graph classification
- random graphs
- graph theoretical
- graph search
- structural pattern recognition
- graph properties
- graph partitioning
- undirected graph
- graph data
- subgraph isomorphism
- dynamic graph
- spanning tree
- disk resident
- graph transformation
- graph isomorphism
- graph kernels
- series parallel
- maximum common subgraph
- inexact graph matching
- real world graphs
- bipartite graph
- average degree
- connected components
- graph representations
- web graph
- maximum cardinality
- massive graphs
- reachability queries
- graph layout
- connected dominating set
- maximum clique
- directed acyclic
- association graph
- graph patterns
- structured data
- adjacency graph
- topological information
- finding the shortest path
- maximal cliques
- evolving graphs
- pattern mining
- minimum spanning tree
- proximity graph
- random walk
- shortest path
- small world
- dense subgraphs
- frequent subgraphs
- polynomial time complexity
- community discovery
- neighborhood graph
- edge weights
- directed acyclic graph
- social graphs
- planar graphs
- connected graphs
- strongly connected
- attributed graphs
- degree distribution