Maximum graphs non-Hamiltonian-connected from a vertex

DOI10.1017/S0017089500005462zbMATH Open0537.05037OpenAlexW2097098760MaRDI QIDQ3322129FDOQ3322129

Authors: George R. T. Hendry 

Publication date: 1984

Published in: Glasgow Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0017089500005462

Recommendations

• The minimum size of graphs Hamiltonian-connected from a vertex
• Edge bounds in nonhamiltonian \(k\)-connected graphs
• scientific article; zbMATH DE number 1246415
• On maximal paths and circuits of graphs
• Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex

zbMATH Keywords

Hamiltonian pathHamiltonian connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Connectivity (05C40)

Cites Work

• Note on Hamilton Circuits

Cited In (5)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximum graphs not spannable by \(r\) disjoint paths
• The minimum size of graphs Hamiltonian-connected from a vertex
• Title not available (Why is that?)

This page was built for publication: Maximum graphs non-Hamiltonian-connected from a vertex

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