1![Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1 Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set R´emy Belmonte1,? , Pim van ’t Hof1,? , Marcin Kami´ nski2,?? , and Dani¨el Paulusma3,? ? ? 1](https://www.pdfsearch.io/img/0b8306c075ccf3e4cc04ddd9bce2f315.jpg) | Add to Reading ListSource URL: rutcor.rutgers.eduLanguage: English - Date: 2014-07-12 10:24:09
|
---|
2![Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague Graph minors, decompositions and algorithms (Lecture notes) Jiˇr´ı Fiala Department of Applied Mathematics, Charles University, Prague](https://www.pdfsearch.io/img/171d746d0718ad9c158cc1663113b826.jpg) | Add to Reading ListSource URL: kam.mff.cuni.czLanguage: English - Date: 2014-06-02 07:40:12
|
---|
3![Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro Decomposition by maximal cliques and forbidden subgraphs for path graphs Hugo Nobrega1 COPPE/Engenharia de Sistemas e Computa¸ca ˜o Universidade Federal do Rio de Janeiro](https://www.pdfsearch.io/img/d04ab56863fdce6c9a1a55b4ceaf58dd.jpg) | Add to Reading ListSource URL: dl.dropboxusercontent.comLanguage: English |
---|
4![Region Counting Graphs Jean Cardinal∗ S´ebastien Collette† Abstract Region Counting Graphs Jean Cardinal∗ S´ebastien Collette† Abstract](https://www.pdfsearch.io/img/0712b0ce5a36b8fece700eef59a54079.jpg) | Add to Reading ListSource URL: www.ulb.ac.beLanguage: English - Date: 2011-02-08 09:21:41
|
---|
5![On Forbidden Subdivision Characterization of Graph Classes Zdenˇek Dvoˇra´k Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´ On Forbidden Subdivision Characterization of Graph Classes Zdenˇek Dvoˇra´k Charles University, Faculty of Mathematics and Physics, Institute for Theoretical Computer Science (ITI) 1 Malostransk´e n´](https://www.pdfsearch.io/img/be69a63632a8688b2a1f336c96ffa108.jpg) | Add to Reading ListSource URL: iti.mff.cuni.czLanguage: English - Date: 2016-02-04 05:53:37
|
---|
6![C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi](https://www.pdfsearch.io/img/30c5b8047de7e3d51af15ef079012bb7.jpg) | Add to Reading ListSource URL: www.zaik.uni-koeln.deLanguage: English - Date: 2015-02-02 16:29:21
|
---|
7![Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb Discrete Mathematics–252 www.elsevier.com/locate/disc Forbidden minors to graphs with small feedback sets Michael J. Dinneena;∗ , Kevin Cattellb , Michael R. Fellowsb](https://www.pdfsearch.io/img/ae1300c075b45769cae626b7e3e0a35c.jpg) | Add to Reading ListSource URL: www.mrfellows.netLanguage: English - Date: 2009-08-06 03:07:31
|
---|
8![Journal of Universal Computer Science, vol. 3, no), submitted: 8/8/97, accepted: , appeared: Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona Journal of Universal Computer Science, vol. 3, no), submitted: 8/8/97, accepted: , appeared: Springer Pub. Co. A Note on the Computability of Graph Minor Obstruction Sets for Mona](https://www.pdfsearch.io/img/4de6fb2a9dce4df4fef63c20609298e2.jpg) | Add to Reading ListSource URL: www.mrfellows.netLanguage: English - Date: 2009-10-14 09:38:23
|
---|
9![First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh First Section Flavors of Rigidity Flavor IV - Reconstructing Discrete Networks University of Pittsburgh](https://www.pdfsearch.io/img/b6f8c23346c97d19436203030df888c2.jpg) | Add to Reading ListSource URL: www.math.cornell.eduLanguage: English - Date: 2015-01-22 09:08:15
|
---|
10![Studies on Subgraph and Supergraph Enumeration Algorithms Masashi Kiyomi DOCTOR OF Studies on Subgraph and Supergraph Enumeration Algorithms Masashi Kiyomi DOCTOR OF](https://www.pdfsearch.io/img/476c472c345aa85cf03c09a4e3424e72.jpg) | Add to Reading ListSource URL: www.nii.ac.jpLanguage: English - Date: 2010-03-08 19:45:48
|
---|