Login / Signup
Smallest 3-graphs having a 3-colored edge in every k-coloring.
F. Sterboul
Published in:
Discret. Math. (1979)
Keyphrases
</>
weighted graph
undirected graph
graph matching
edge information
graph theory
series parallel
edge detection
graph representation
edge map
minimum spanning trees
edge weights
graph theoretic
spanning tree
graph databases
graph clustering
subgraph isomorphism
graph structure
vertex set
adjacency graph
shortest path