On Mixed Cages
From MaRDI portal
Publication:6507902
DOI10.46298/DMTCS.11057arXiv2207.05904MaRDI QIDQ6507902FDOQ6507902
Authors: Geoffrey Exoo 
Abstract: Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Paths and cycles (05C38)
This page was built for publication: On Mixed Cages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6507902)
