Edge bounds in nonhamiltonian k-connected graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Edges and Kuratowski Subgraphs of Non-Planar Graphs
- The maximum size of a nonhamiltonian graph with given order and connectivity
- Maximum graphs non-Hamiltonian-connected from a vertex
- Extremal graphs with given stability number and connectivity. I
- Cyclability, connectivity and circumference
- The first zagreb index and some hamiltonian properties of the line graph of a graph
- A stability version for a theorem of Erdős on nonhamiltonian graphs
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree
- Harary index and some Hamiltonian properties of graphs
- Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- Bounding \(\ell\)-edge-connectivity in edge-connectivity
- On the extremal number of edges in Hamiltonian connected graphs
- Eigenvalues, Laplacian eigenvalues, and Hamiltonian connectivity of graphs
- scientific article; zbMATH DE number 7090173 (Why is no real title available?)
- Signless Laplacian Spectral Radius and Some Hamiltonian Properties of Graphs
- Some topological indices and graph properties
This page was built for publication: Edge bounds in nonhamiltonian \(k\)-connected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879332)