✦ LIBER ✦

On k-ordered graphs

✍ Scribed by Jill R. Faudree; Ralph J. Faudree; Ronald J. Gould; Michael S. Jacobson; Linda Lesniak

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 149 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200010)35:2<69::aid-jgt1>3.0.co;2-i

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

k-ordered Hamiltonian graphs

✍ Ng, Lenhard; Schultz, Michelle 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 2 views

A hamiltonian graph G of order n is k-ordered, 2 ≤ k ≤ n, if for every sequence v 1 , v 2 , . . . , v k of k distinct vertices of G, there exists a hamiltonian cycle that encounters v 1 , v 2 , . . . , v k in this order. Theorems by Dirac and Ore, presenting sufficient conditions for a graph to be h

Onk-ordered Hamiltonian graphs

✍ Kierstead, H. A.; S�rk�zy, G. N.; Selkow, S. M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB 👁 1 views

the smallest integer m for which any graph on n vertices with minimum degree at least m is a k-ordered Hamiltonian graph. In this article, answering a question of Ng and Schultz, we determine

r-domination problems on homogeneously o

r-domination problems on homogeneously orderable graphs

✍ Dragan, Feodor F.; Nicolai, Falk 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 1 views

In this paper, we consider r-dominating cliques in homogeneously orderable graphs (a common generalization of dually chordal and distance-hereditary graphs) and their relation to strict r-packing sets. We prove that a homogeneously orderable graph G possesses an r-dominating clique if and only if fo

Tolerance graphs, and orders

✍ Felsner, Stefan 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 1 views

We show that, if a tolerance graph is the complement of a comparability graph, it is a trapezoid graph, i.e., the complement of an order of interval dimension at most 2. As consequences we are able to give obstructions for the class of bounded tolerance graphs and to give an example of a graph that

The symmetric (2k, k)-graphs

✍ Matthias Kriesell 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

On the perfect orderability of unions of

On the perfect orderability of unions of two graphs

✍ Ho�ng, Ch�nh T.; Tu, Xiaodan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 264 KB 👁 1 views

A graph G is perfectly orderable, if it admits an order < on its vertices such that the sequential coloring algorithm delivers an optimum coloring on each induced subgraph (H, <) of (G, <). A graph is a threshold graph, if it contains no P 4 , 2K 2 , and C 4 as induced subgraph. A theorem of Chvátal