Pairs of Adjacent Hamiltonian Circuits with Small Intersection
From MaRDI portal
Publication:4182254
DOI10.1002/sapm1978593245zbMath0398.90073OpenAlexW2336629765MaRDI QIDQ4182254
Publication date: 1978
Published in: Studies in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/sapm1978593245
Extremal problems in graph theory (05C35) Integer programming (90C10) Eulerian and Hamiltonian graphs (05C45)
Related Items
Maximizing Hamiltonian pairs and \(k\)-sets via numerous leaves in a tree ⋮ Sparse Hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles ⋮ Some graphic uses of an even number of odd nodes
Cites Work