On Hamiltonian Decomposition Problem of 3-Arc Graphs
Sign Up to like & getrecommendations! Published in 2022 at "Computational Intelligence and Neuroscience"
DOI: 10.1155/2022/5837405
Abstract: A 4-tuple (y, x, v, w) in a graph is a 3-arc if each of (y, x, v) and (x, v, w) is a path. The 3-arc graph of H is the graph with vertex… read more here.
Keywords: hamiltonian decomposition; hamilton; arc; arc graph ... See more keywords