C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable.
Yingqian Wang
Ming Chen
Liang Shen
Published in:
Discret. Math. (2008)
Keyphrases
</>
graph matching
fixed length
graph theory
weighted graph
data sets
three dimensional
adjacency matrix
bipartite graph
graph structure
graph mining
graph representation
series parallel
random graphs
graph theoretic
graph databases
graph model
graphical models
data mining