An explicit construction of graphs of bounded degree that are far from being Hamiltonian.

Isolde Adler Noleen Köhler

Published in: Discret. Math. Theor. Comput. Sci. (2022)

Keyphrases

bounded degree
graph theoretic
bounded treewidth
graph matching
graph representation
construction process
databases
decision making
logic programs
graph theory