Minimumk-hamiltonian graphs, II

DOI10.1002/jgt.3190100111zbMath0592.05043OpenAlexW2002023091MaRDI QIDQ3720636

No author found.

Publication date: 1986

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190100111

zbMATH Keywords

hamiltonian graphsedge hamiltonian graph

Mathematics Subject Classification ID

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

Related Items (11)

Tolerating faults in a mesh with a row of spare nodes ⋮ Extremal \(P_4\)-stable graphs ⋮ One node fault tolerance for caterpillars and starlike trees ⋮ On the construction of combinedk-fault-tolerant Hamiltonian graphs ⋮ Extremal \(k\)-edge-Hamiltonian hypergraphs ⋮ An optimal result on fault-tolerant cycle-embedding in alternating group graphs ⋮ 2-edge-Hamiltonian-connectedness of 4-connected plane graphs ⋮ Optimal 1-edge fault-tolerant designs for ladders. ⋮ Powers of connected graphs and hamiltonicity ⋮ Extremal k-edge-hamiltonian Hypergraphs ⋮ Hamiltonian Chains in Hypergraphs

Cites Work

• Unnamed Item

This page was built for publication: Minimumk-hamiltonian graphs, II