Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On hamiltonian connectedness of \(K_{1,4}\)-free graphs - MaRDI portal

On hamiltonian connectedness of \(K_{1,4}\)-free graphs (Q1567290)

From MaRDI portal





scientific article; zbMATH DE number 1455617
Language Label Description Also known as
English
On hamiltonian connectedness of \(K_{1,4}\)-free graphs
scientific article; zbMATH DE number 1455617

    Statements

    On hamiltonian connectedness of \(K_{1,4}\)-free graphs (English)
    0 references
    23 January 2001
    0 references
    \textit{G. Chen} and \textit{R. H. Schelp} [J. Graph Theory 20, No. 4, 423-439 (1995; Zbl 0843.05072)] proved that every 3-connected \(K_{1,4}\)-free graph \(G\) on \(n\) vertices with \(d(v_1) + d(v_2) + d(v_3) \geq n + 4\) for any independent set \(\{v_1, v_2, v_3\}\) of \(G\) is hamiltonian connected. In this paper it is shown that every 3-connected \(K_{1,4}\)-free graph \(G \notin J\) on at most \(4\delta - 10\) vertices is hamiltonian connected, where \(J\) is a set of exceptional graphs and \(\delta\) stands for the minimum degree of \(G\).
    0 references
    hamiltonian connectedness
    0 references
    \(K_{1,4}\)-free graphs
    0 references
    minimum degrees
    0 references
    0 references

    Identifiers