1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Graph Theory

  1. Apr 1, 2012 #1
    Prove by induction on the number of edges in a graph that any bipartite graph has edge colouring number equal to its maximum valency. Also, Find such an edge colouring for a bipartite 4-regular cartesian or tensor product of your choice of 2-regular graphs
  2. jcsd
  3. Apr 1, 2012 #2


    User Avatar
    Science Advisor

    Hey Stephane G and welcome to the forums.

    For these kinds of questions, we ask that you show any working and any of your thinking before we help with these kinds of problems, since it is in the form of a homework problem (note it doesn't have to be a homework problem, just in the format of one).

    What ideas do you have? What have you tried before?
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Graph Theory
  1. Graph Theory (Replies: 3)

  2. Graph theory (Replies: 5)

  3. Graph theory (Replies: 10)

  4. Graph Theory (Replies: 3)