Tree Preservation Orders in Conham
Conham is a suburb in City of Bristol within South Gloucestershire Council, the planning authority responsible for Tree Preservation Orders here.
Some Tree Preservation Orders shown sit just over Conham's boundary in Bristol City Council. Conham itself falls within South Gloucestershire Council.
TPO details
0267— 15 trees, 2 groups
South Gloucestershire CouncilNeed to work on a tree?
We can connect you with a vetted local tree surgeon or arborist.
Work with trees for a living? Get matched with local leads — free to join →259— Woodland(Woodland)
Bristol City CouncilTP1175— 8 trees
Bristol City Council1272— Woodland
Bristol City CouncilTP160— 3 trees
Bristol City Council
This data is provided for informational purposes only and may not reflect the most up-to-date position. If you are planning work on or near a protected tree, you should contact your local planning authority to confirm the current status of any Tree Preservation Orders.
Frequently Asked Questions
Are there Tree Preservation Orders in Conham?
We show over 500 TPO records within 2km of Conham centre, some of which fall just over the boundary in Bristol City Council.
How do I check for TPOs near Conham?
Enter your postcode in our search tool to see TPOs near Conham plotted on an interactive map. Results show Tree Preservation Orders within 200m of your postcode centroid.
Which planning authority covers Conham?
Conham falls within South Gloucestershire Council, which is responsible for making and enforcing Tree Preservation Orders in the area. Some TPOs shown on our map sit within 2km of the centre but fall under neighbouring Bristol City Council.
What happens if I do work on a TPO tree near Conham?
Carrying out prohibited work on a TPO-protected tree without consent is a criminal offence. Destroying a protected tree can result in an unlimited fine. Other unauthorised work, such as lopping or topping, can result in a fine of up to £2,500. If you need to carry out work, apply to your local planning authority for consent first.