Pseudo-Hamiltonian-connected graphs

DOI10.1016/S0166-218X(99)00181-XzbMath0939.05054WikidataQ126671684 ScholiaQ126671684MaRDI QIDQ1971217

Xuding Zhu, Gerard Jennhwa Chang

Publication date: 29 June 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

regularizabilityvertex packingbeetle problempseudo-Hamiltonian connectedregular Hamiltonian walk

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Crown reductions for the minimum weighted vertex cover problem

Cites Work

• Unnamed Item
• Tough graphs and Hamiltonian circuits.
• Minimum node covers and 2-bicritical graphs
• Toughness and the existence ofk-factors
• Vertex packings: Structural properties and algorithms
• On the integer-valued variables in the linear vertex packing problem
• Regularisable Graphs

This page was built for publication: Pseudo-Hamiltonian-connected graphs