ON α,β DESTRUCTIBLE GRAPHS

DOI10.1080/16073606.1984.9632328zbMath0544.05051OpenAlexW2062808670MaRDI QIDQ3333080

Paul August Winter, Henda C. Swart

Publication date: 1984

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1984.9632328

zbMATH Keywords

reconstruction problemsdestructibility

Mathematics Subject Classification ID

Graph theory (05C99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (5)

A CHARACTERIZATION OF STABLE GRAPHS ON A MAXIMUM(MINIMUM) NUMBER OF EDGES ⋮ ALL GRAPHS ON A NON-PRIME NUMBER OF VERTICES ARE DESTRUCTIBLE ⋮ A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS ⋮ ON α,β CYCLE-CONTRACTIBLE GRAPHS ⋮ ON STABLE GRAPHS

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing trees from two point deleted subtrees
• Some basic observations on Kelly's conjecture for graphs
• On Ulam's conjecture for separable graphs
• A note on the line reconstruction problem
• Graph reconstruction—a survey
• The Reconstruction of a Tree from its Maximal Subtrees
• Reconstruction of Cacti
• Reconstruction of Trees

This page was built for publication: ON α,β DESTRUCTIBLE GRAPHS