MinimumK-hamiltonian graphs

DOI10.1002/JGT.3190080118zbMATH Open0534.05040OpenAlexW1988048939MaRDI QIDQ3317136FDOQ3317136

Authors:

Publication date: 1984

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

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

Recommendations

• Minimumk-hamiltonian graphs, II
• Powers of connected graphs and hamiltonicity
• Publication:3469119
• scientific article; zbMATH DE number 4093499
• Publication:4726283

zbMATH Keywords

Hamiltonian graphsminimum k-edge Hamiltonian graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cited In (21)

• Hamiltonian Chains in Hypergraphs
• On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs
• Optimal 1-edge fault-tolerant designs for ladders.
• Extremal k-edge-hamiltonian Hypergraphs
• Graph theory (algorithmic, algebraic, and metric problems)
• Explicit construction of linear sized tolerant networks
• Minimumk-hamiltonian graphs, II
• A result about the incident edges in the graphs \(M_ k\)
• Tolerating faults in a mesh with a row of spare nodes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal \(k\)-edge-Hamiltonian hypergraphs
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• Title not available (Why is that?)
• The number of cycles in a Hamilton graph
• One node fault tolerance for caterpillars and starlike trees
• Title not available (Why is that?)
• Powers of connected graphs and hamiltonicity
• Designing distrance-preserving fault-tolerant topologies
• Subgraphs intersecting any Hamiltonian cycle
• Explicit construction of linear sized tolerant networks. (Reprint)

This page was built for publication: MinimumK-hamiltonian graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3317136)