On minimal regular digraphs with given girth

DOI10.4064/fm-69-3-227-231zbMath0203.26502OpenAlexW1596555387MaRDI QIDQ5603090

Curtiss E. Wall, Mehdi Behzad, Gary Chartrand

Publication date: 1970

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/214245

Related Items (17)

Some approaches to a conjecture on short cycles in digraphs ⋮ Even cycles in directed graphs ⋮ A note on minimal directed graphs with given girth ⋮ Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture ⋮ Unnamed Item ⋮ Directed triangles in digraphs ⋮ An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem ⋮ Existence of openly disjoint circuits through a vertex ⋮ Cycles of given length in oriented graphs ⋮ Openly disjoint circuits through a vertex in regular digraphs ⋮ On diregular digraphs with degree two and excess three ⋮ On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity ⋮ Short cycles in oriented graphs ⋮ Mixed cages ⋮ On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs ⋮ A note on the girth of digraphs ⋮ Note on the regular digraphs

This page was built for publication: On minimal regular digraphs with given girth