Graph Connectivity and Hamiltonian Properties

Graph connectivity and Hamiltonian properties lie at the heart of both theoretical combinatorics and practical network design. Connectivity quantifies the robustness of a network by the minimum number of vertices or edges whose removal disconnects the graph, while Hamiltonian properties concern the existence of cyclic or path structures that visit every node exactly once. Classical results such as Dirac’s and Ore’s theorems establish degree-based sufficient conditions for Hamiltonicity. More recent advances have broadened these conditions to include spectral bounds, probabilistic constructions and refined structural criteria based on forbidden subgraphs. Applications range from the travelling-salesman problem and circuit routing to the resilience analysis of communication and transport systems. Emerging research continues to link local constraints—such as bounded second-neighbourhoods or the absence of small induced subgraphs—to global Hamiltonian behaviour, thereby deepening our understanding of both extremal graph theory and algorithms for large-scale networks.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Recent studies have deepened understanding of structural and forbidden subgraph conditions for traceability and Hamiltonicity. One work characterised pairs of disconnected forbidden subgraphs ensuring traceability in block-chains, delineating precise subgraph configurations that guarantee the existence of spanning Hamiltonian paths in graph families assembled by simple polynomial tests. Another investigation addressed regular graphs with bounded second neighbourhoods, proving that all connected 3-, 4- and 5-regular graphs whose vertices’ distance-2 neighbourhoods satisfy a modest connectivity condition are Hamiltonian, while determining that Hamiltonicity becomes NP-complete in the 6-regular case yet recovers under local connectivity constraints. A recent contribution introduced paw-type forbidden subgraph conditions for Hamilton-connected graphs, identifying minimal induced subgraphs whose absence in any 3-connected graph suffices to ensure that every ordered pair of vertices lies on a spanning cycle, with practical implications for the design of efficient data-centre networks.

Graph Connectivity and Hamiltonian Properties publication trend

The graph below shows the total number of articles in graph connectivity and hamiltonian properties across all publications each year (not limited to Nature Index journals).

Technical terms

Connectivity: A measure of a graph’s resilience, defined by the minimum number of vertices or edges whose removal disconnects the graph.

Hamiltonian cycle: A closed loop that visits each vertex exactly once before returning to its start, central to route planning and circuit design.

Traceable graph: A graph containing a Hamiltonian path, a non-closed sequence visiting all vertices exactly once.

Hamilton-connected: A stronger property requiring a Hamiltonian path between every ordered pair of distinct vertices.

Forbidden subgraph condition: A structural criterion specifying small subgraphs whose absence guarantees global cycle or path properties.

k-regular graph: A graph in which every vertex has exactly k incident edges, often used to model uniform connectivity.

References

1. Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains. Symmetry (2022).
2. On Hamiltonicity of regular graphs with bounded second neighborhoods. Discrete Applied Mathematics (2022).
3. Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs. Axioms (2023).