Handshaking lemma

Known as: Handshake lemma, Odd node, Odd vertex 
In graph theory, a branch of mathematics, the handshaking lemma is the statement that every finite undirected graph has an even number of vertices… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2014
01219922014

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Let G = (V,E) be a graph and q be an odd prime power. We prove that G possess a proper vertex coloring with q colors if and only… (More)
Is this relevant?
2012
2012
Let G be a graph and τ : V (G) → N ∪ {0} be an assignment of thresholds to the vertices of G. A subset of vertices D is said to… (More)
Is this relevant?
2011
2011
In the k-set agreement task each process proposes a value, and it is required that each correct process has to decide a value… (More)
  • figure 1
Is this relevant?
2008
2008
In this paper we consider problems related to Nash-Williams’ well-balanced orientation theorem and odd-vertex pairing theorem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The study of charmonium dissociation in heavy ion collisions is generally performed in the framework of effective Lagrangians… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2006
2006
In this paper we consider problems related to Nash-Williams’ wellbalanced orientation theorem and odd-vertex pairing theorem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2004
2004
This note contains some remarks on the well-balanced orientation theorem of Nash-Williams [10]. He announced in [11] an extension… (More)
Is this relevant?
1999
1999
Perhaps the simplest useful theorem of graph theory is that every graph X has an even number of odd (degree) nodes. We give new… (More)
Is this relevant?
1996
1996
Let G = (V; E) be a simple, undirected graph. A subset U V is odd if the subgraph of G induced by U has an odd number of edges… (More)
Is this relevant?
1992
1992
In the case of a 2-cell embedding (i.e., in the case where every region of the embedding is homeomorphic to a disk), the… (More)
  • figure 2
  • figure 3
Is this relevant?