Edges

Results: 704



#Item
111

The Minimum Size of 3-Graphs without a 4-Set Spanning No or Exactly Three Edges Oleg Pikhurko∗ Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213

Add to Reading List

Source URL: homepages.warwick.ac.uk

Language: English - Date: 2011-10-03 12:10:48
    112

    Front cover art - full bleed (to the edges) www.army.mil/netcom I

    Add to Reading List

    Source URL: www.netcom.army.mil

    Language: English - Date: 2013-11-27 14:30:15
      113

      Discrete Mathematics–100 www.elsevier.com/locate/disc Parallelogram-faced isohedra with edges in mirror-planes Branko Grunbaum

      Add to Reading List

      Source URL: www.math.washington.edu

      Language: English - Date: 2004-07-13 19:09:34
        114

        Front cover art - full bleed (to the edges) www.army.mil/netcom I

        Add to Reading List

        Source URL: www.netcom.army.mil

        Language: English
          115

          Front cover art - full bleed (to the edges) www.army.mil/netcom I

          Add to Reading List

          Source URL: www.netcom.army.mil

          Language: English
            116

            On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching Deepak Bal∗ Andrzej Dudek† Zelealem B. Yilma∗ Abstract In this note, we determine the maximum number of edges of a k-uniform hypergraph,

            Add to Reading List

            Source URL: homepages.wmich.edu

            Language: English
              117

              Consider n randomly placed points on a circle.   n 1. The complete graph on the n points has edges. 2

              Add to Reading List

              Source URL: www.texample.net

              - Date: 2011-12-05 16:02:33
                118

                All closest neighbors are proper Delaunay edges generalized, and its application to parallel algorithms Arne Maus Jon Moen Drange

                Add to Reading List

                Source URL: home.ifi.uio.no

                Language: English - Date: 2010-06-18 10:44:51
                  119

                  THEOREM OF THE DAY The Handshaking Lemma In any graph the sum of the vertex degrees is equal to twice the number of edges. The degree of a vertex is the number of edges incident with it (a self-loop joining a vertex to

                  Add to Reading List

                  Source URL: www.theoremoftheday.org

                  Language: English - Date: 2014-06-30 10:40:03
                    120

                    Edge-decomposition of graphs into copies of a tree with four edges J´anos Bar´at ∗

                    Add to Reading List

                    Source URL: www.renyi.hu

                    Language: English - Date: 2012-11-13 11:12:50
                      UPDATE