✦ LIBER ✦

A characterization of competition graphs

✍ Scribed by R.D. Dutton; R.C. Brigham

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 172 KB
Volume: 6
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(83)90085-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A characterization of competition graphs of arbitrary digraphs

✍ Fred S. Roberts; Jeffrey E. Steif 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 271 KB

A characterization of graphs of competit

A characterization of graphs of competition number m

✍ J.Richard Lundgren; John S. Maybee 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 245 KB

p-competition graphs

✍ Suh-ryung Kim; Terry A. McKee; F.R. McMorris; Fred S. Roberts 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 892 KB

Chromatic numbers of competition graphs

✍ J.Richard Lundgren; Sarah K. Merz; Craig W. Rasmussen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 964 KB

The domination and competition graphs of

The domination and competition graphs of a tournament

✍ Fisher, David C.; Lundgren, J. Richard; Merz, Sarah K.; Reid, K. B. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 230 KB 👁 2 views

Vertices x and y dominate a tournament T if for all vertices z / = x, y, either x beats z or y beats z. Let dom(T ) be the graph on the vertices of T with edges between pairs of vertices that dominate T . We show that dom(T ) is either an odd cycle with possible pendant vertices or a forest of cater

Interval competition graphs of symmetric

Interval competition graphs of symmetric diagraphs

✍ J.Richard Lundgren; Craig W. Rasmussen; John S. Maybee 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 700 KB

interval competition graphics of symmetric digrapha. Discrete Mathematics I I9 (1993) I I3 122. The competition graph of a loopless symmetric digraph If is the rwo-.\rc'p grclph. S,(H). Necessary and sufficient conditions on If are given for S,(ff) to be interval or unit interval. These are useful p