On the optional hamiltonian completion problem

DOI10.1002/net.3230060104zbMath0323.05121OpenAlexW2026263715MaRDI QIDQ4085751

S. Goodman, Stephen T. Hedetniemi, Peter J. Slater

Publication date: 1976

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230060104

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

\(k\)-path partitions in trees ⋮ On island sequences of labelings with a condition at distance two ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Path coverings of the vertices of a tree ⋮ A linear algorithm for the number of degree constrained subforests of a tree ⋮ Hamiltonian completions of sparse random graphs

This page was built for publication: On the optional hamiltonian completion problem