✦ LIBER ✦

Competition Graphs of Hamiltonian Digraphs

✍ Scribed by Guichard, David R.

Book ID: 118199585
Publisher: Society for Industrial and Applied Mathematics
Year: 1998
Tongue: English
Weight: 203 KB
Volume: 11
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s089548019629735x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Competition Graphs of Strongly Connected

Competition Graphs of Strongly Connected and Hamiltonian Digraphs

✍ Fraughnaugh, Kathryn F.; Lundgren, J. Richard; Merz, Sarah K.; Maybee, John S.; 📂 Article 📅 1995 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1019 KB

A characterization of competition graphs

A characterization of competition graphs of arbitrary digraphs

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

A class of acyclic digraphs with interva

A class of acyclic digraphs with interval competition graphs

✍ Han Hyuk Cho; Suh-Ryung Kim 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 195 KB

The competition-common enemy graph of a

The competition-common enemy graph of a digraph

✍ Debra D. Scott 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Hamiltonian cycles and paths in Cayley g

Hamiltonian cycles and paths in Cayley graphs and digraphs — A survey

✍ Stephen J. Curran; Joseph A. Gallian 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 927 KB

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the hyperbolic plane, and in combinatorial designs. Moreover, Babai has shown that all graphs can be realized as an induced

On Hamiltonian Powers of Digraphs

✍ Antoni Marczyk 📂 Article 📅 2000 🏛 Springer Japan 🌐 English ⚖ 137 KB