1![Digraphs Methods for digraphs VersionJan De Beule Julius Jonušas Digraphs Methods for digraphs VersionJan De Beule Julius Jonušas](https://www.pdfsearch.io/img/4d542c8bec24e1dac88d6332c408f21a.jpg) | Add to Reading ListSource URL: www.gap-system.orgLanguage: English - Date: 2018-05-11 06:23:13
|
---|
2![Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs Hao Huang∗ Jie Ma† Large feedback arc sets, high minimum degree subgraphs, and long cycles in Eulerian digraphs Hao Huang∗ Jie Ma†](https://www.pdfsearch.io/img/3e361bfc717d2c7e39fcb74c785ad2e7.jpg) | Add to Reading ListSource URL: staff.ustc.edu.cnLanguage: English - Date: 2015-01-05 01:58:16
|
---|
3![Pruning digraphs for reducing catchment zones Fernand Meyer Centre de Morphologie Mathématique 19 March 2017 Pruning digraphs for reducing catchment zones Fernand Meyer Centre de Morphologie Mathématique 19 March 2017](https://www.pdfsearch.io/img/a343ee565e20e665f775f771b6c4bfd6.jpg) | Add to Reading ListSource URL: cmm.ensmp.frLanguage: English - Date: 2017-04-19 05:07:05
|
---|
4![Operators on images encoded as digraphs Fernand Meyer Centre de Morphologie Mathématique 16 April 2017 Operators on images encoded as digraphs Fernand Meyer Centre de Morphologie Mathématique 16 April 2017](https://www.pdfsearch.io/img/dad06bff6b9866f499b21c88bd724553.jpg) | Add to Reading ListSource URL: cmm.ensmp.frLanguage: English - Date: 2017-04-19 05:07:05
|
---|
5![Average Consensus on Strongly Connected Weighted Digraphs: A Generalized Error Bound Eduardo Montijano a,b Andrea Gasparri c Attilio Priolo c Carlos Sagues b a b Average Consensus on Strongly Connected Weighted Digraphs: A Generalized Error Bound Eduardo Montijano a,b Andrea Gasparri c Attilio Priolo c Carlos Sagues b a b](https://www.pdfsearch.io/img/a86e0d1eb188884596149fe0eaa7e6a5.jpg) | Add to Reading ListSource URL: gasparri.dia.uniroma3.itLanguage: English - Date: 2016-03-31 07:09:14
|
---|
6![arXiv:1610.05839v1 [math.CO] 19 OctCycles with two blocks in k-chromatic digraphs Ringi Kim∗ Seog-Jin Kim† arXiv:1610.05839v1 [math.CO] 19 OctCycles with two blocks in k-chromatic digraphs Ringi Kim∗ Seog-Jin Kim†](https://www.pdfsearch.io/img/67ffdd23f004528c4b86fab559f5dd5c.jpg) | Add to Reading ListSource URL: staff.ustc.edu.cnLanguage: English - Date: 2016-10-20 01:22:20
|
---|
7![Finding good 2-partitions of digraphs I. Hereditary properties J Bang-Jensen, Fr´ed´eric Havet To cite this version: J Bang-Jensen, Fr´ed´eric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Jo Finding good 2-partitions of digraphs I. Hereditary properties J Bang-Jensen, Fr´ed´eric Havet To cite this version: J Bang-Jensen, Fr´ed´eric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Jo](https://www.pdfsearch.io/img/e0a42952ccb2b38a2dbd63c17004e329.jpg) | Add to Reading ListSource URL: hal.archives-ouvertes.fr- Date: 2016-12-19 10:50:21
|
---|
8![Finding good 2-partitions of digraphs II. Enumerable properties Joergen Bang-Jensen, Nathann Cohen, Fr´ed´eric Havet To cite this version: Joergen Bang-Jensen, Nathann Cohen, Fr´ed´eric Havet. Finding good 2-partitio Finding good 2-partitions of digraphs II. Enumerable properties Joergen Bang-Jensen, Nathann Cohen, Fr´ed´eric Havet To cite this version: Joergen Bang-Jensen, Nathann Cohen, Fr´ed´eric Havet. Finding good 2-partitio](https://www.pdfsearch.io/img/150e50d2e10c0e98012f5aa6082413c5.jpg) | Add to Reading ListSource URL: hal.archives-ouvertes.fr- Date: 2016-12-21 19:40:23
|
---|
9![Subdivisions of oriented cycles in digraphs with large chromatic number Nathann Cohen, Fr´ed´eric Havet, William Lochet, Nicolas Nisse To cite this version: Nathann Cohen, Fr´ed´eric Havet, William Lochet, Nicolas Ni Subdivisions of oriented cycles in digraphs with large chromatic number Nathann Cohen, Fr´ed´eric Havet, William Lochet, Nicolas Nisse To cite this version: Nathann Cohen, Fr´ed´eric Havet, William Lochet, Nicolas Ni](https://www.pdfsearch.io/img/bff93da29834891db85bf11ecec61f77.jpg) | Add to Reading ListSource URL: hal.archives-ouvertes.fr- Date: 2016-12-19 08:07:11
|
---|
10![Identifying k-Majority Digraphs via SAT Solving Felix Brandt Christian Geist Hans Georg Seedig Identifying k-Majority Digraphs via SAT Solving Felix Brandt Christian Geist Hans Georg Seedig](https://www.pdfsearch.io/img/820fa4986cb22c40accbb6a2f5fadb41.jpg) | Add to Reading ListSource URL: www.explore14.preflib.org- Date: 2014-10-02 20:21:51
|
---|