Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded.

Ringi Kim O-joung Kwon Sang-il Oum Vaidy Sivaraman

Published in: CoRR (2018)

Keyphrases

polynomially bounded
directed graph
undirected graph
labeled graphs
data sets
hamiltonian cycle
attributed graphs
algebraic structures
subgraph isomorphism
database
neural network
graph theory
graph databases
strongly connected
vertex set