Two-graph

Results: 168



#Item
51On the Enumeration of Bipartite Minimum Edge Colorings Yasuko MATSUI and Takeaki UNO Abstract. For a bipartite graph G = (V, E), an edge coloring of G is a coloring of the edges of G such that any two adjacent edges are

On the Enumeration of Bipartite Minimum Edge Colorings Yasuko MATSUI and Takeaki UNO Abstract. For a bipartite graph G = (V, E), an edge coloring of G is a coloring of the edges of G such that any two adjacent edges are

Add to Reading List

Source URL: research.nii.ac.jp

Language: English - Date: 2010-09-24 01:42:07
    52ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

    ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

    Add to Reading List

    Source URL: page.math.tu-berlin.de

    Language: English
      53On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl

      On the Complexity of Paths Avoiding Forbidden Pairs Petr Kolman and Ondˇrej Pangr´ac Abstract Given a graph G = (V, E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the probl

      Add to Reading List

      Source URL: iti.mff.cuni.cz

      Language: English - Date: 2016-02-04 05:53:37
        54ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

        ONLINE AND SIZE ANTI-RAMSEY NUMBERS MARIA AXENOVICH, KOLJA KNAUER, JUDITH STUMPP, AND TORSTEN UECKERDT Abstract. A graph is properly edge-colored if no two adjacent edges have the same color. The smallest number of edges

        Add to Reading List

        Source URL: www.math.kit.edu

        Language: English - Date: 2015-11-10 14:19:32
          55Exponentials / Ordinary differential equations / Human geography / Exponential growth / World population / Carrying capacity / Population growth / Growth curve / Logarithm / Demography / Statistics / Population

          Directions: Look at the graphs below and answer the following questions. Population Ecology Graph Worksheet -20955020383500Graphs 1- Exponential Growth & Carrying Capacity 1. Which of the two cu

          Add to Reading List

          Source URL: flashesbiology.weebly.com

          Language: English
          56Mining and1981 Graph Kernels Nauty –Graph McKay   Assign a unique (canonical) label to graphs such that two isomorphic

          Mining and1981 Graph Kernels Nauty –Graph McKay   Assign a unique (canonical) label to graphs such that two isomorphic

          Add to Reading List

          Source URL: agbs.kyb.tuebingen.mpg.de

          Language: English - Date: 2012-02-09 07:29:34
            5722 IP1 Structural and Logical Approaches to the Graph Isomorphism Problem The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has

            22 IP1 Structural and Logical Approaches to the Graph Isomorphism Problem The question of whether there is a polynomial time algorithm deciding whether two graphs are isomorphic has

            Add to Reading List

            Source URL: www.siam.org

            - Date: 2012-01-03 17:09:43
              581 WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs where 7 lon

              1 WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX? MARIA AXENOVICH Abstract. It is well known that any two longest paths in a connected graph share a vertex. It is also known that there are connected graphs where 7 lon

              Add to Reading List

              Source URL: www.math.kit.edu

              Language: English - Date: 2012-09-05 04:03:35
                59Algorithms – handout 5 Spectral graph theory June 2, 2014 The adjacency matrix of a connected undirected graph is nonnegative, symmetric and irreducible (namely, it cannot be decomposed into two diagonal blocks and two

                Algorithms – handout 5 Spectral graph theory June 2, 2014 The adjacency matrix of a connected undirected graph is nonnegative, symmetric and irreducible (namely, it cannot be decomposed into two diagonal blocks and two

                Add to Reading List

                Source URL: www.wisdom.weizmann.ac.il

                Language: English - Date: 2014-06-15 03:43:21
                  60Advanced Algorithms 2012A – Problem Set 7 Robert Krauthgamer February 4, 2012 Extra credit: 1. Design a variant of Cheeger’s inequalities, where the input graph comes with two dinstinguished vertices s, t ∈ V , and

                  Advanced Algorithms 2012A – Problem Set 7 Robert Krauthgamer February 4, 2012 Extra credit: 1. Design a variant of Cheeger’s inequalities, where the input graph comes with two dinstinguished vertices s, t ∈ V , and

                  Add to Reading List

                  Source URL: www.wisdom.weizmann.ac.il

                  Language: English - Date: 2012-02-04 09:08:01