-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton.
Abdelkader KhelladiCharles PayanPublished in: J. Comb. Theory, Ser. B (1984)
Keyphrases
- graph matching
- directed graph
- random walk
- weighted graph
- graph representation
- neural network
- model checking
- graph theory
- graph structure
- graph construction
- graph clustering
- stable set
- data sets
- graph coloring
- formal verification
- random graphs
- minimum spanning tree
- spanning tree
- graph model
- graph mining
- information extraction
- search algorithm