Some applications of Vizing's theorem to vertex colorings of graphs.
Henry A. KiersteadJames H. SchmerlPublished in: Discret. Math. (1983)
Keyphrases
- directed graph
- hamiltonian cycle
- undirected graph
- graph coloring
- attributed graphs
- labeled graphs
- graph matching
- average degree
- graph representation
- vertex set
- graph theoretic
- graph mining
- maximum cardinality
- neural network
- graph partitioning
- bipartite graph
- edge weights
- connected subgraphs
- betweenness centrality
- series parallel
- graph databases
- random walk