Mixed cages
From MaRDI portal
Publication:2334064
DOI10.1007/s00373-019-02050-1zbMath1426.05053arXiv1702.07255OpenAlexW3037668929MaRDI QIDQ2334064
César Hernández-Cruz, Juan José Montellano-Ballesteros, Gabriela Araujo-Pardo
Publication date: 6 November 2019
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.07255
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items (2)
On networks with order close to the Moore bound ⋮ Mixed cages: monotonicity, connectivity and upper bounds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A family of mixed graphs with large order and diameter 2
- On mixed Moore graphs
- Non existence of some mixed Moore graphs of diameter 2 using SAT
- Moore bound for mixed networks
- A note on the girth of digraphs
- A note on minimal directed graphs with given girth
- A new general family of mixed graphs
- Dynamic cage survey
- New mixed Moore graphs and directed strongly regular graphs
- Minimal 2-regular digraphs with given girth
- Connectivity of Transitive Digraphs and a Combinatorial Property of Finite Groups
- On minimal regular digraphs with given girth
This page was built for publication: Mixed cages