scientific article

zbMath0641.05037MaRDI QIDQ3781786

P. Paulraja, R. Balakrishnan

Publication date: 1986

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

zbMATH Keywords

Hamiltonianline graphchordal graphspanning Eulerian subgraph

Mathematics Subject Classification ID

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

Related Items (11)

Claw-free graphs---a survey ⋮ Toughness and Hamiltonicity in \(k\)-trees ⋮ Supereulerian graphs: A survey ⋮ Hamiltonian cycles in 7-tough \((P_3 \cup 2P_1)\)-free graphs ⋮ A reduction method to find spanning Eulerian subgraphs ⋮ A sufficient condition for Hamiltonicity in locally finite graphs ⋮ Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs ⋮ Toughness in graphs -- a survey ⋮ Hamilton cycles and closed trails in iterated line graphs ⋮ Unnamed Item ⋮ Chvátal’s t 0-Tough Conjecture

This page was built for publication: