article · 1990

A Constructive Proof of Vizing&apos;s Theorem

J Misra, David Gries

Cited by 0Abstract and details only

Abstract

is free on u) : Each edge X v for v 2 hf::li is called a fan edge. The following (nondeterministic) algorithm constructs a fan F that is maximal, in that it cannot be extended: F := hY i; do (9v :: B) ! F := F cat v where v satisfies B od where B is the predicate B : X v is an edge v = 2 F 1 This work was done while the second author was on sabbatic from Cornell at Austin. 1 color of X v is free on the last vertex of F : The algorithm Our algorithm for coloring edge X Y is given below

Cite this paper

APA 7

Misra, J., & Gries, D. (1990). A Constructive Proof of Vizing&apos;s Theorem.

MLA 9

Misra, J, and David Gries. “A Constructive Proof of Vizing&apos;s Theorem.” 1990.

Chicago

Misra, J, and David Gries. 1990. “A Constructive Proof of Vizing&apos;s Theorem.”

Harvard

Misra, J. and Gries, D. (1990) ‘A Constructive Proof of Vizing&apos;s Theorem’.

BibTeX

@article{misra1990constructive,
  title = {{A Constructive Proof of Vizing&amp;apos;s Theorem}},
  author = {Misra, J and Gries, David},
  year = {1990}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.