Three-coloring graphs with no induced seven-vertex path I : the triangle-free case.

Maria Chudnovsky Peter Maceli Mingxian Zhong

Published in: CoRR (2014)

Keyphrases

undirected graph
directed graph
hamiltonian cycle
graph theoretic
graph matching
data sets
pairwise
graph structure
minimum cost
strongly connected
vertex set
average degree