Colouring vertices of triangle-free graphs without forests.
Konrad K. DabrowskiVadim V. LozinRajiv RamanBernard RiesPublished in: Discret. Math. (2012)
Keyphrases
- weighted graph
- labeled graphs
- random graphs
- undirected graph
- attributed graphs
- hamiltonian cycle
- maximal cliques
- adjacency matrix
- planar graphs
- graph matching
- edge weights
- graph model
- connected subgraphs
- directed edges
- maximum cardinality
- bipartite graph
- graph partitioning
- minimum weight
- graph theory
- real time
- directed graph
- vertex set
- graph structure
- spanning tree
- subgraph isomorphism
- graph mining
- graph structures
- triangle mesh
- graph construction
- approximation algorithms
- similarity function
- average degree
- data sets
- graph clustering