-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges.
Saeed AkbariSeyed Vahab MirrokniSayyed Bashir SadjadPublished in: J. Comb. Theory, Ser. B (2001)
Keyphrases
- undirected graph
- directed graph
- spanning tree
- minimum cost
- edge weights
- minimum weight
- vertex set
- weighted graph
- minimum spanning tree
- approximation algorithms
- labeled graphs
- connected components
- bipartite graph
- directed acyclic graph
- graph structures
- connected subgraphs
- complex networks
- shortest path
- random walk
- average degree
- hamiltonian cycle
- graph structure
- directed edges
- np hard
- attributed graphs
- critical points
- edge information
- graph matching
- social networks