Digraphs

Results: 99



#Item
1

Digraphs Methods for digraphs VersionJan De Beule Julius Jonušas

Add to Reading List

Source URL: www.gap-system.org

Language: 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†

    Add to Reading List

    Source URL: staff.ustc.edu.cn

    Language: 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

      Add to Reading List

      Source URL: cmm.ensmp.fr

      Language: 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

        Add to Reading List

        Source URL: cmm.ensmp.fr

        Language: 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

          Add to Reading List

          Source URL: gasparri.dia.uniroma3.it

          Language: 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†

            Add to Reading List

            Source URL: staff.ustc.edu.cn

            Language: 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

              Add to Reading List

              Source 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

                Add to Reading List

                Source 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

                  Add to Reading List

                  Source 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

                    Add to Reading List

                    Source URL: www.explore14.preflib.org

                    - Date: 2014-10-02 20:21:51
                      UPDATE