From b76ffc7f2a56955e2cdeb93f6902c40d3bbcffdd Mon Sep 17 00:00:00 2001
From: Ashish Kumar <ashishkr23438@gmail.com>
Date: Thu, 9 Dec 2021 11:56:38 +0530
Subject: [PATCH] Typo fix in graph edge_coloring docs (#209)

---
 doc/edge_coloring.html | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/edge_coloring.html b/doc/edge_coloring.html
index 691704bd..bcc5df23 100644
--- a/doc/edge_coloring.html
+++ b/doc/edge_coloring.html
@@ -52,7 +52,7 @@ colors c<sub>1</sub>, c<sub>2</sub>, ..., c<sub>n</sub> in a way
 that no vertex connects with 2 edges of the same color. Furthermore
 at most m + 1 colors are used.
 
-<!-- King, I.P. An automatic reordering scheme for simultaneous equations derived from network analysis. Int. J. Numer. Methods Engrg. 2 (1970), 523-533 -->
+<!-- Misra, J., & Gries, D. (1992). A constructive proof of Vizing's theorem. In Information Processing Letters. -->
 
 <h3>Where defined</h3>
 <a href="../../../boost/graph/edge_coloring.hpp"><tt>boost/graph/edge_coloring.hpp</tt></a>
@@ -80,7 +80,7 @@ OUT: <tt>ColorMap color</tt>
 <h3>Example</h3>
 
 See <A
-href="../example/edge_coloring.cpp"><tt>example/king_ordering.cpp</tt></A>.
+href="../example/edge_coloring.cpp"><tt>example/edge_coloring.cpp</tt></A>.
 
 <h3>See Also</h3>