From a33791d3f489cf8216516baafa246713b736a204 Mon Sep 17 00:00:00 2001
From: Martin Mares <mj@ucw.cz>
Date: Fri, 22 Feb 2008 18:02:08 +0100
Subject: [PATCH] Names of theorems are typeset on a separate line.

---
 macros.tex | 8 ++++----
 mst.tex    | 2 +-
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/macros.tex b/macros.tex
index c10500e..aab43d9 100644
--- a/macros.tex
+++ b/macros.tex
@@ -346,11 +346,11 @@
 
 \def\label#1{{\sl (#1)\/}\enspace}
 
-\def\thmn{\thm\label}
-\def\lemman{\lemma\label}
-\def\defnn{\defn\label}
+\def\thmn#1{\thm\label{#1}\hfil\break}
+\def\lemman#1{\lemma\label{#1}\hfil\break}
+\def\defnn#1{\defn\label{#1}\hfil\break}
 \def\algn{\alg\label}
-\def\notan{\nota\label}
+\def\notan#1{\nota\label{#1}\hfil\break}
 
 \def\proof{\noindent {\sl Proof.}\enspace}
 \def\proofsketch{\noindent {\sl Proof sketch.}\enspace}
diff --git a/mst.tex b/mst.tex
index 6f0dea7..549a7ab 100644
--- a/mst.tex
+++ b/mst.tex
@@ -550,7 +550,7 @@ As in the original Bor\o{u}vka's algorithm, the number of iterations is $\O(\log
 Then apply the previous lemma.
 \qed
 
-\thmn{\cite{mm:mst}}\id{planarbor}%
+\thmn{Contractive Bor\o{u}vka on planar graphs, \cite{mm:mst}}\id{planarbor}%
 When the input graph is planar, the Contractive Bor\o{u}vka's algorithm runs in
 time $\O(n)$.
 
-- 
2.39.2