Bounded vertex colorings of graphs.
Pierre HansenAlain HertzJulio KuplinskyPublished in: Discret. Math. (1993)
Keyphrases
- undirected graph
- labeled graphs
- directed graph
- hamiltonian cycle
- attributed graphs
- graph coloring
- graph theory
- graph matching
- graph theoretic
- connected subgraphs
- edge weights
- maximum cardinality
- average degree
- vertex set
- approximation algorithms
- bounded treewidth
- minimum weight
- graph mining
- bipartite graph
- random graphs
- minimum spanning tree
- combinatorial problems
- graph model
- search algorithm