
#1
Apr112, 07:40 PM

P: 2

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 4regular cartesian or tensor product of your choice of 2regular graphs




#2
Apr112, 07:44 PM

P: 4,570

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? 


Register to reply 
Related Discussions  
Graph Theory: Bipartite Graph Question  Calculus & Beyond Homework  2  
Graph Theory: Complement of a Graph  General Math  4  
[Graph theory] Formula for the size of a line graph  Calculus & Beyond Homework  0  
Graph theory line graph proof  Calculus & Beyond Homework  0  
Graph and Free Graph in Category Theory  General Math  0 