✦ LIBER ✦

A relation between the comparability graph and the number of linear extensions

✍ Scribed by Grzegorz Stachowiak

Publisher: Springer Netherlands
Year: 1989
Tongue: English
Weight: 160 KB
Volume: 6
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00563525

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear vizing-like relation between th

A linear vizing-like relation between the size and the domination number of a graph

✍ Rautenbach, Dieter 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB 👁 2 views

We prove m ≤ ∆n -(∆ + 1)γ for every graph without isolated vertices of order n, size m, domination number γ and maximum degree ∆ ≥ 3. This generalizes a result of Fisher et al., CU-Denver Tech Rep, 1996] who obtained the given bound for the case ∆ = 3.

The number of linear extensions of bipar

The number of linear extensions of bipartite graphs

✍ Grzegorz Stachowiak 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 124 KB

The number of linear extensions among the orientations of a bipartite graph is maximum just if the orientation itself is bipartite, the natural one.

A linear Vizing-like relation relating t

A linear Vizing-like relation relating the size and total domination number of a graph

✍ Michael A. Henning 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 77 KB

## Abstract We prove that __m__ ≤ Δ (__n__ − γ~t~) for every graph each component of which has order at least 3 of order __n__, size __m__, total domination number γ~t~, and maximum degree Δ ≥ 3. © 2005 Wiley Periodicals, Inc. J Graph Theory 49: 285–290, 2005

Inequalities for the number of linear ex

Inequalities for the number of linear extensions

✍ A. Sidorenko 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 490 KB

Inequalities between the domination numb

Inequalities between the domination number and the chromatic number of a graph

✍ Dieter Gernert 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Upper bounds for u + x and ax are proved, where u is the domination number and x the chromatic number of a graph.

Erratum to: “A linear vizing-like relati

Erratum to: “A linear vizing-like relation relating the size and total domination number of a graph”

✍ Erfang Shan; Liying Kang; Michael A. Henning 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB

## Abstract The proof of the main theorem in the paper [1] is incorrect as it is missing an important case. Here we complete the proof by giving the missing case. © 2007 Wiley Periodicals, Inc. J Graph Theory 54: 350–353, 2007