Re: A proposition about graph theory

In article <3vrda5F17hpnuU1@xxxxxxxxxxxxxx>,
José Carlos Santos <jcsantos@xxxxxxxx> wrote:

> ....
> Could someone please tell me where can I find a proof of the proposition
> that says that, in a planar simple graph, there's at least one vertex
> whose degree is not greater than 5? Please don't waste your time posting
> a proof, since what I want is to be able to cite a printed source....


I don't know the origin of it, but here's an elementary text-book
reference:

Robin J. Wilson, "Introduction to Graph Theory," 2nd edition 1979, p.
67, Theorem 13F.

Ken Pledger.
.

Relevant Pages

  • Re: A graph theoretic problem
    ... >What is the minimal number n, such that for any graph G with n vertices, ... >either G or Complementis non-planar? ... Both are planar according to "isplanar": ... Prev by Date: ...
    (sci.math)
  • [Graph theory] Coloring a planar graph
    ... I'm going to do a program who let to detect if a graph is planar or no. ... I must find an algorithm using this properties. ... Prev by Date: ...
    (sci.math.research)
  • Re: A graph problem
    ... For ease of reference, I will call the colors red ... the entire graph must be one-colored. ... Since any graph of size 6 or larger contains a subgraph of size ... Prev by Date: ...
    (sci.math)
  • A graph theoretic problem
    ... What is the minimal number n, such that for any graph G with n vertices, ... either G or Complementis non-planar? ... planar. ... Prev by Date: ...
    (sci.math)
  • Reference line in graph
    ... I would like to put a reference line in a graph. ... Excel? ... Prev by Date: ...
    (microsoft.public.excel.charting)
Quantcast