On the optional hamiltonian completion problem

DOI10.1002/NET.3230060104zbMATH Open0323.05121OpenAlexW2026263715MaRDI QIDQ4085751FDOQ4085751

Authors: S. Goodman, Stephen T. Hedetniemi, Peter 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)

Cited In (6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4085751)