On the optional hamiltonian completion problem

DOI10.1002/NET.3230060104MaRDI QIDQ4085751zbMATH OpenOpenAlexFDO

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)

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