A Lower Bound for the Number of Vertices of a Graph
From MaRDI portal
Publication:5525917
DOI10.2307/2316031zbMath0147.42901OpenAlexW2319680926MaRDI QIDQ5525917
Publication date: 1967
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2316031
Related Items
A Lower Bound on the Number of Vertices of a Graph ⋮ Steiner 4-diameter, maximum degree and size of a graph ⋮ Maximally edge-connected and vertex-connected graphs and digraphs: A survey ⋮ On local connectivity of graphs ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs ⋮ Some relations among invariants of graphs ⋮ Factorisations courtes dans un groupe fini. (Short factorizations in a finite group)
This page was built for publication: A Lower Bound for the Number of Vertices of a Graph