Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Local connectivity of a random graph

From MaRDI portal
Publication:3310660
Jump to:navigation, search

DOI10.1002/jgt.3190070405zbMath0529.05053OpenAlexW2156549096MaRDI QIDQ3310660

Edgar M. Palmer, Robert W. Robinson

Publication date: 1983

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190070405


zbMATH Keywords

local connectivityinduced subgraphthreshold functionneighbourhood connected


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)


Related Items (5)

On graphs whose eternal vertex cover number and vertex cover number coincide ⋮ Hamiltonicity of locally Hamiltonian and locally traceable graphs ⋮ Threshold functions for local properties of graphs: Triangles ⋮ Partitioning random graphs into monochromatic components ⋮ The Hamilton cycle problem for locally traceable and locally Hamiltonian graphs






This page was built for publication: Local connectivity of a random graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3310660&oldid=16535453"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 4 February 2024, at 12:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki