Testing Convexity Properties of Tree Colorings

DOI10.1007/978-3-540-70918-3_10zbMath1186.68337OpenAlexW2108903713MaRDI QIDQ3590927

Orly Yahalom, Eldar Fischer

Publication date: 3 September 2007

Published in: STACS 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_10

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Randomized algorithms (68W20)

Related Items (1)

On the Query Complexity of Testing Orientations for Being Eulerian

This page was built for publication: Testing Convexity Properties of Tree Colorings