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)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Uwe Schauz
- Electr. J. Comb.
- 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

- Kaveh Khoshkhah, Hossein Soltani, Manouchehr Zaker
- Discrete Optimization
- 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

- Hagit Attiya, Armando CastaÃ±eda
- SSS
- 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)

Is this relevant?

2008

2008

- Attila BernÃ¡th, Satoru Iwata, TamÃ¡s KirÃ¡ly, ZoltÃ¡n KirÃ¡ly, ZoltÃ¡n Szigeti
- Discrete Optimization
- 2008

In this paper we consider problems related to Nash-Williamsâ€™ well-balanced orientation theorem and odd-vertex pairing theoremâ€¦Â (More)

Is this relevant?

2006

2006

- L. B. Holanda, Antonio Mihara
- 2006

The study of charmonium dissociation in heavy ion collisions is generally performed in the framework of effective Lagrangiansâ€¦Â (More)

Is this relevant?

2006

2006

In this paper we consider problems related to Nash-Williamsâ€™ wellbalanced orientation theorem and odd-vertex pairing theoremâ€¦Â (More)

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

- Kathie Cameron, Jack Edmonds
- SODA
- 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

- Tomaz Pisanski, Thomas W. Tucker, Dave Witte Morris
- Combinatorica
- 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)

Is this relevant?