Sign in
A 4-cycle and a 2-factor with two components of a graph satisfying the Chvátal-Erdös condition.
Atsushi Kaneko
Kiyoshi Yoshimoto
Published in:
Electron. Notes Discret. Math. (2000)
Keyphrases
</>
strictly convex
sufficient conditions
graph theory
graph representation
building blocks
graph model
random walk
search algorithm
structured data
connected components
directed graph
objective function
weighted graph
undirected graph
random graphs
graph search
stable set