Coloring edges and vertices of graphs without short or long cycles.
Vadim V. LozinMarcin KaminskiPublished in: Contributions Discret. Math. (2007)
Keyphrases
- weighted graph
- undirected graph
- edge weights
- directed edges
- directed graph
- vertex set
- spanning tree
- adjacency matrix
- shortest path
- graph structure
- labeled graphs
- random graphs
- minimum weight
- bipartite graph
- approximation algorithms
- graph partitioning
- densely connected
- complex networks
- real world graphs
- graph model
- subgraph isomorphism
- attributed graphs
- minimum cost
- graph matching
- minimum spanning tree
- massive graphs
- planar graphs
- hamiltonian cycle
- maximal cliques
- graph structures
- query graph
- average degree
- edge information
- graph databases