Q. a graph is called k-planar if every vertex has degree
k.
(a) Explain why any k-regular graph with 11 vertices should contain
an Euler’s circuit.
(what are the possible values of k).
(b) Suppose G is a 6-regular graph. Must the chromatic number of G
be at leat 6? Explain.
Get Answers For Free
Most questions answered within 1 hours.