Unilaterally connected large digraphs and generalized cycles

DOI10.1002/NET.10095MaRDI QIDQ4446908zbMATH OpenOpenAlexFDO

Authors J. Gomez, Eduardo A. Canale, Xavier Muñoz

Publication date 3 February 2004

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.10095

zbMATH Keywords

\((\DeltaD)\)-problemMoore digraphsunilaterally connected digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Recommendations

• Large generalized cycles
• On the connectivity of generalized p-cycles.
• On the unilateral (?,D*)-problem
• Dense bipartite digraphs
• Restricted arc-connectivity of generalized \(p\)-cycles

Cites work

• A note on constructing large Cayley graphs of given degree and diameter by voltage assignments
• Large generalized cycles
• On almost regular tournament matrices
• On the unilateral (?,D*)-problem

Cited in

(4)

• Disjoint paths of bounded length in large generalized cycles
• On the connectivity of generalized p-cycles.
• On the unilateral (?,D*)-problem
• The (, D) and (,N) problems in double-step digraphs with unilateral distance

This page was built for publication: Unilaterally connected large digraphs and generalized cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4446908)