Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles.

Carsten Thomassen

Published in: J. Comb. Theory, Ser. B (2023)

Keyphrases

planar graphs
graph matching
graph coloring
graph theoretic
bipartite graph
weighted graph
planar surfaces
graph clustering
subgraph isomorphism
computationally hard
series parallel
graph mining
spanning tree
combinatorial problems
neural network
random graphs
directed graph
clustering algorithm