On the existence of graphs which can colour every regular graph.
Giuseppe MazzuoccoloGloria TabarelliJean Paul ZerafaPublished in: Discret. Appl. Math. (2023)
Keyphrases
- graph representation
- graph theory
- graph structure
- weighted graph
- directed graph
- graph construction
- graph matching
- adjacency matrix
- labeled graphs
- graph theoretic
- graph theoretical
- graph model
- graph mining
- graph clustering
- graph classification
- graph structures
- graph search
- graph partitioning
- graph databases
- series parallel
- bipartite graph
- graph properties
- graph representations
- subgraph isomorphism
- spanning tree
- structural pattern recognition
- graph isomorphism
- dynamic graph
- graph transformation
- graph kernels
- random graphs
- graph data
- directed acyclic
- graph drawing
- evolving graphs
- maximum clique
- inexact graph matching
- maximum common subgraph
- real world graphs
- disk resident
- connected dominating set
- massive graphs
- undirected graph
- minimum spanning tree
- attributed graphs
- connected graphs
- web graph
- dense subgraphs
- reachability queries
- graph patterns
- neighborhood graph
- graph embedding
- relational structures
- social graphs
- average degree
- structured data
- maximum independent set
- directed acyclic graph
- edge weights
- planar graphs
- shortest path
- adjacency graph
- pattern mining
- topological information
- relational graph
- quasi cliques
- vertex set
- bounded treewidth
- proximity graph
- maximal cliques
- small world
- query graph
- colour images
- fully connected