scientific article; zbMATH DE number 3297026
From MaRDI portal
Publication:5580168
Cited in
(20)- Tough graphs and Hamiltonian circuits. (Reprint)
- On large semi-linked graphs
- On the connectivity of diamond-free graphs
- Isolated Rupture in Composite Networks
- Graphs with prescribed local connectivities
- Maximally edge-connected graphs and zeroth-order general Randić index for \(\alpha\leq-1\)
- Best monotone degree conditions for graph properties: a survey
- A bound on the size of a graph with given order and bondage number
- On local connectivity of graphs
- On a theorem of Chartrand, Kapoor and Kronk
- Index of parameters of iterated line graphs
- On the connectivity of non-commuting graph of finite rings
- Optimal graphs with prescribed connectivities
- Tough graphs and Hamiltonian circuits.
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- Maximally and super connected multisplit graphs and digraphs
- Lower bounds on the vertex-connectivity of digraphs and graphs
- Connectivity of iterated line graphs
- Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
- Statistical theory of connectivity. I: Basic definitions and properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5580168)
