Extremal sizes of spanning connected graphs

DOI10.1016/J.DAM.2026.02.002MaRDI QIDQ7230330zbMATH OpenFDO

Authors Yingying Chen, Eminjan Sabir

Publication date 17 April 2026

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2026.02.002

zbMATH Keywords

Hamilton-connectedHamiltonianminimum degreespanning connected

Mathematics Subject Classification ID

Vertex degrees (05C07) Distance in graphs (05C12) Extremal problems in graph theory (05C35) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites work

• A method in graph theory
• Biclosure and bistability in a balanced bipartite graph
• Graph theory
• On spanning connected graphs
• On the spanning connectivity and spanning laceability of hypercube-like networks
• On the spanning connectivity of tournaments
• Ore-type degree conditions for disjoint path covers in simple graphs
• Some Theorems on Abstract Graphs
• Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
• Spanning connectivity of \(K_{1 , r}\)-free split graphs
• Spectral analogues of Erdős' and Moon-Moser's theorems on Hamilton cycles
• Spectral analogues of Erdős' theorem on Hamilton-connected graphs
• Spectral conditions and Hamiltonicity of a balanced bipartite graph with large minimum degree
• Sufficient conditions for graphs to be spanning connected
• Super spanning connectivity of split-star networks
• The spanning laceability on the faulty bipartite hypercube-like networks
• The super connectivity of the pancake graphs and the super laceability of the star graphs

This page was built for publication: Extremal sizes of spanning connected graphs

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