The maximum degree of a minimally Hamiltonian-connected graph

DOI10.1016/J.DISC.2022.113159MaRDI QIDQ2675871zbMATH OpenOpenAlexWikidataFDO

Authors Xingzhi Zhan

Publication date 26 September 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2201.05292

zbMATH Keywords

maximum degreeminimally Hamiltonian-connected graphminimum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Extremal problems in graph theory (05C35) Connectivity (05C40)

Abstract: We determine the possible maximum degrees of a minimally hamiltonian-connected graph with a given order. This answers a question posed by Modalleliyan and Omoomi in 2016. We also pose two unsolved problems.

Recommendations

• On the extremal number of edges in Hamiltonian connected graphs
• Hamiltonian-connected graphs with large neighborhoods and degrees
• scientific article; zbMATH DE number 1247721
• On hamiltonian‐connected graphs
• The minimum size of graphs Hamiltonian-connected from a vertex

Cites work

• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• Critical Hamiltonian connected graphs.
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected
• scientific article; zbMATH DE number 854567 (Why is no real title available?)

Cited in

(2)

• Graphs with many Hamiltonian paths
• The maximum size of a nonhamiltonian-connected graph with given order and minimum degree

This page was built for publication: The maximum degree of a minimally Hamiltonian-connected graph

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