The least connected non-vertex-transitive graph with constant neighbourhoods

DOI10.21136/cmj.1990.102416zbMath0743.05031OpenAlexW3048118448MaRDI QIDQ3982731

Bohdan Zelinka

Publication date: 26 June 1992

Full work available at URL: https://eudml.org/doc/13884

zbMATH Keywords

neighbourhood graphgraph with constant neighbourhoodsneighbourhood realization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (1)

An infinite family of incidence geometries whose incidence graphs are locally X

Cites Work

• Which trees are link graphs?

This page was built for publication: The least connected non-vertex-transitive graph with constant neighbourhoods