On minimal neighbourhood-connected graphs

DOI10.1016/0012-365X(91)90271-3zbMath0759.05060OpenAlexW2039200643MaRDI QIDQ1182928

Bert L. Hartnell, William L. Kocay

Publication date: 28 June 1992

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(91)90271-3

zbMATH Keywords

neighbourhood-connected graphs

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (3)

The firefighter problem for graphs of maximum degree three ⋮ A generalization of the firefighter problem on \(\mathbb Z \times \mathbb Z\) ⋮ The firefighter problem for cubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Neighbour-connectivity in regular graphs
• Survival under random coverings of trees
• Optimal K-secure graphs
• Graphs with constant link and small degree or order
• Neighbor-connected graphs and projective planes

This page was built for publication: On minimal neighbourhood-connected graphs