On the unilateral (?,D*)-problem

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0037(200010)36:3<164::AID-NET3>3.0.CO;2-N" /><164::AID-NET3>3.0.CO;2-N 10.1002/1097-0037(200010)36:3<164::AID-NET3>3.0.CO;2-NzbMath0980.05029OpenAlexW1998258735MaRDI QIDQ4520240

Eduardo A. Canale, José Gómez, Xavier Muñoz

Publication date: 12 December 2000

Full work available at URL: https://doi.org/10.1002/1097-0037(200010)36:3<164::aid-net3>3.0.co;2-n

zbMATH Keywords

Moore bounddense digraphslarge constructionsunilateral diameter

Mathematics Subject Classification ID

Operations research and management science (90B99) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Unilaterally connected large digraphs and generalized cycles

Cites Work

• Large graphs with given degree and diameter. II
• A Study of Minimally Unilateral Digraphs
• Line Digraph Iterations and the (d, k) Digraph Problem
• Algebraic Graph Theory
• Unnamed Item

This page was built for publication: On the unilateral (?,D*)-problem