Hamilton connectedness and the partially square graphs (Q2497487): Difference between revisions

Let \(G\) be a \(k\)-connected graph. The authors use the notions of a partially sqauare graph \(G^*\) of \(G\) and a quasi-claw-free graph. They prove that a \(k\)-connected graph \(G\) \((k\geq 3)\) is either Hamiltonian-connected or the independence number of \(G^*\) is at least \(k\). The authors also give a positive answer to two open problems from the literature.