Research problems

DOI10.1016/0012-365X(89)90310-5MaRDI QIDQ5966492zbMATH OpenOpenAlexFDO

Authors Zdzisław Skupień

Publication date 1989

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(89)90310-5

Review text

In problem 106--108, the author proposes three claims concerning tough non-hamiltonian graphs with \(n\geq 2\) vertices.

Recommendations

• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems

Cited in

(12)

• Research problem 40
• All nonhamiltonian tough graphs satisfying a 3-degree sum and Fan-type conditions
• Measuring the vulnerability for classes of intersection graphs
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems
• Research problems

This page was built for publication: Research problems

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