New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

First Page		Document Content
Date: 2013-03-14 00:55:15 Graph theory Graph operations NP-complete problems Bipartite graphs Combinatorial optimization Matching Line graph Chordal graph Clique Complete bipartite graph Independent set Cograph		New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School Add to Reading List Source URL: community.dur.ac.uk Download Document from Source Website File Size: 438,20 KB Share Document on Facebook

	Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs Rahul Arora, Ashu Gupta, Rohit Gurjar∗, and Raghunath Tewari Indian Institute of Technology Kanpur {arorar, ashug, rgurjar, rtewari}@iitk.ac.in A DocID: 1vcqK - View Document
	Forbidden induced bipartite graphs Peter Allen∗ Department of Mathematics London School of Economics Houghton St. London WC2A 2AE DocID: 1v9r0 - View Document
	Minimum Color Sum of Bipartite Graphs Amotz Bar-Noy Department of Electrical Engineering, Tel-Aviv University, Tel-Aviv 69978, Israel. E-mail: . Guy Kortsarz DocID: 1v3bw - View Document
	Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org DETERMINISTICALLY ISOLATING A PERFECT MATCHING IN BIPARTITE PLANAR GRAPHS SAMIR DATTA 1 , RAGHAV KULKARNI 2 , AND SAMBU DocID: 1uYYo - View Document
	Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Samir Datta1 , Raghav Kulkarni2 , Raghunath Tewari3 , and N. V. Vinodchandran4 1 DocID: 1uBb3 - View Document