On minimal regular digraphs with given girth
From MaRDI portal
Cited in
(23)- A note on the girth of digraphs
- Note on the regular digraphs
- Even cycles in directed graphs
- A note on minimal directed graphs with given girth
- Directed triangles in digraphs
- Counting subgraphs: A new approach to the Caccetta-Häggkvist conjecture
- Some approaches to a conjecture on short cycles in digraphs
- On diregular digraphs with degree two and excess three
- Mixed cages
- On the second neighborhood conjecture of Seymour for regular digraphs with almost optimal connectivity
- Short cycles in oriented graphs
- On the Caccetta-Häggkvist conjecture with forbidden subgraphs
- scientific article; zbMATH DE number 3861195 (Why is no real title available?)
- An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
- Existence of openly disjoint circuits through a vertex
- On mixed cages
- Degree conditions forcing oriented cycles
- Bounds on the acyclic disconnection of a digraph
- A note on mixed cages of girth 5
- Totally regular mixed graphs constructed from the CD(n,q) graphs of Lazebnik, Ustimenko and Woldar
- Openly disjoint circuits through a vertex in regular digraphs
- New upper bounds on the order of mixed cages of girth 6
- Cycles of given length in oriented graphs
This page was built for publication: On minimal regular digraphs with given girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5603090)
