Reconfiguration graph for vertex colourings of weakly chordal graphs.
Carl FeghaliJirí FialaPublished in: Discret. Math. (2020)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- spanning tree
- graph structure
- adjacency matrix
- directed acyclic graph
- edge weights
- random graphs
- approximation algorithms
- weighted graph
- attributed graphs
- vertex set
- average degree
- graph theory
- connected components
- strongly connected
- connected subgraphs
- minimum cost
- graph structures
- graph construction
- graph representation
- minimum weight
- graph matching
- complex networks
- hamiltonian cycle
- maximum cardinality
- minimum spanning tree
- graph theoretic
- graph partitioning
- graph databases
- graph mining
- bipartite graph
- graph representations
- graph theoretical
- structural pattern recognition
- graph data
- social graphs
- graph properties
- graph classification
- neighborhood graph
- graph kernels
- np hard
- graph model
- random walk