scientific article

zbMath0709.05022MaRDI QIDQ3491603

Hao Li, Christine Virlouvet

Publication date: 1990

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian graphindependent set of verticesclaw free graphsk-connected graph\(K_{1,3}\)-free graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs ⋮ Claw-free graphs---a survey ⋮ Minimum independent generalized \(t\)-degree and independence number in \(K_{1,r+1}\)-free graphs ⋮ Dominating cycles in bipartite biclaw-free graphs ⋮ Degree and neighborhood conditions for Hamiltonicity of claw-free graphs ⋮ Independent sets in \(\{\text{claw}, K_4 \}\)-free 4-regular graphs ⋮ Independence and upper irredundance in claw-free graphs ⋮ Hamiltonian properties of graphs with large neighborhood unions ⋮ On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs ⋮ On lower bounds for the chromatic number in terms of vertex degree ⋮ Zero forcing in claw-free cubic graphs ⋮ Irredundance ⋮ Upper total domination in claw-free cubic graphs ⋮ On the independence number in \(K_{1,r+1}\)-free graphs

This page was built for publication: