Pages that link to "Item:Q1049242"

The following pages link to On the extremal number of edges in Hamiltonian connected graphs (Q1049242):

Displaying 11 items.

• On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight (Q315484) (← links)
• Edge bounds in nonhamiltonian \(k\)-connected graphs (Q879332) (← links)
• The size of graphs uniquely Hamiltonian-connected from a vertex (Q1078574) (← links)
• The minimum size of graphs Hamiltonian-connected from a vertex (Q1119940) (← links)
• The number of edges, spectral radius and Hamilton-connectedness of graphs (Q1752616) (← links)
• Generalizations of the classics to spanning connectedness (Q2242808) (← links)
• The maximum degree of a minimally Hamiltonian-connected graph (Q2675871) (← links)
• Extremal \(k\)-edge-Hamiltonian hypergraphs (Q2816088) (← links)
• On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance (Q2816513) (← links)
• (Q3424775) (← links)
• An improvement of spectral conditions for Hamilton-connected graphs (Q5888823) (← links)