Loading Open Internet

Home Explore Create Profile

Home Explore Create Profile

Open Internet by MindsNet

Graph theory proof of a sharp odd-girth bound for edge-bipartisation in non-3-colourable graphs

Graph theory proof of a sharp odd-girth bound for edge-bipartisation in non-3-colourable graphs