Homework Clinic

Mathematics Clinic => Other Maths => Topic started by: Zulu123 on May 5, 2020

Title: A city crew must paint the median divider along each of the 48 streets in the neighborhood shown ...
Post by: Zulu123 on May 5, 2020

A city crew must paint the median divider along each of the 48 streets in the neighborhood shown below (starting and ending at A). The foreman wants to organize the route in the most efficient possible way.

An optimal eulerization of the graph that models this problem can be obtained by adding
◦ 16 edges.
◦ 10 edges.
◦ 14 edges.
◦ 12 edges.
◦ none of these

Title: A city crew must paint the median divider along each of the 48 streets in the neighborhood shown ...
Post by: mochi09 on May 5, 2020

14 edges.

Title: Re: A city crew must paint the median divider along each of the 48 streets in the neighborhood shown
Post by: neriah turner on Jun 9, 2021

thank you

Title: Re: A city crew must paint the median divider along each of the 48 streets in the neighborhood shown
Post by: Dominic Carmona on Jul 22, 2021

thank you