Mengerian properties, hamiltonicity, and claw‐free graphs

DOI10.1002/net.3230240305zbMath0799.05038OpenAlexW2082897389MaRDI QIDQ4291490

Evelyne Flandrin, Hao Li

Publication date: 10 May 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240305

zbMATH Keywords

connectivityHamilton cycleclaw-free graphsMengerian properties

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

Claw-free graphs---a survey, Property P_d,m and efficient design of reliable networks, The fault-diameter and wide-diameter of twisted hypercubes, Wide diameter for two families of interconnection networks, The wide-diameter of \(Z_{n, k}\), Randomly twisted hypercubes, Domination numbers of undirected toroidal mesh, Wide diameter of Cartesian graph bundles, The independence number for de Bruijn networks and Kautz networks, On \((d,2)\)-dominating numbers of binary undirected de Bruijn graphs, \((d,m)\)-dominating numbers of hypercube

Cites Work

• Unnamed Item
• Relations between packing and covering numbers of a tree