March 23rd, 2017, 03:51 AM  #1 
Newbie Joined: Mar 2017 From: kraków Posts: 1 Thanks: 0  theory of graph
We assume that, G=(X,Y,E), 1<X<Y (or equal) provie if the G is hamiltionian graph > it has a perfect matching 

Tags 
graph, theory 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Graph theory  diameter of biconnected graph  Estevan  Number Theory  2  November 4th, 2016 01:05 PM 
A graph problem in graph theory!  lubna_mira  Applied Math  0  January 12th, 2014 02:52 PM 
Graph theory: Linking graph characteristics and minimal cut  avnerg  Applied Math  0  September 18th, 2013 06:03 AM 
graph theory  social networks and reverting the graph  johnyjj2  Applied Math  0  December 28th, 2010 03:49 PM 
Graph theory  4 stroke graph  kec11494  Applied Math  0  December 14th, 2010 07:01 PM 