Vertex-, edge-, and total-colorings of Sierpinski-like graphs.
Marko JakovacSandi KlavzarPublished in: Discret. Math. (2009)
Keyphrases
- undirected graph
- edge weights
- vertex set
- weighted graph
- directed graph
- graph coloring
- labeled graphs
- minimum weight
- hamiltonian cycle
- attributed graphs
- spanning tree
- minimum cost
- minimum spanning trees
- approximation algorithms
- complex networks
- edge detector
- maximum cardinality
- random graphs
- directed acyclic graph
- connected components
- edge detection
- graph theoretic
- minimum spanning tree
- graph structure
- bipartite graph
- graph matching
- adjacency graph
- graph partitioning
- edge information
- graph mining
- average degree
- connected subgraphs
- neural network