Coloring graph classes with no induced fork via perfect divisibility.

T. Karthick Jenny Kaufmann Vaidy Sivaraman

Published in: CoRR (2021)

Keyphrases

random walk
graph theory
weighted graph
bipartite graph
stable set
state space search
graph based algorithm
equivalence classes
graph mining
graph theoretic
directed graph
connected components
directed acyclic graph
graph model
spanning tree
graph matching
adjacency matrix
social networks