Regular Graphs with Given Girth and Restricted Circuits
From MaRDI portal
Publication:5727293
DOI10.1112/JLMS/S1-38.1.423zbMATH Open0117.17302OpenAlexW2019284393WikidataQ105944630 ScholiaQ105944630MaRDI QIDQ5727293FDOQ5727293
Authors: Horst Sachs 
Publication date: 1963
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-38.1.423
Cited In (42)
- Graph pricing with limited supply
- On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs
- NP-completeness of edge-colouring some restricted graphs
- Spanning trees in regular graphs
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
- Generalized cages
- On the non-existence of antipodal cages of even girth
- Some graph theoretical aspects of generalized truncations
- El problema de las jaulas y los polígonos generalizados
- Recursive constructions of small regular graphs of given degree and girth
- \(t\)-wise Berge and \(t\)-heavy hypergraphs
- The semigroup of combinatorial configurations
- On the limitations of the use of solvable groups in Cayley graph cage constructions
- On decreasing the orders of \((k,g)\)-graphs
- On the homogeneous algebraic graphs of large girth and their applications
- Note on a pursuit game played on graphs
- Small bi-regular graphs of even girth
- Optimal shooting: Characterizations and applications
- Spectra of orders for \(k\)-regular graphs of girth \(g\)
- On the excess of vertex-transitive graphs of given degree and girth
- On networks with order close to the Moore bound
- A note on Halton's conjecture
- Strong edge-coloring of cubic bipartite graphs: a counterexample
- Cops and Robbers on diameter two graphs
- On the density of triangles and squares in regular finite and unimodular random graphs
- A priori TSP in the scenario model
- Title not available (Why is that?)
- Existence of graphs with specified cycle lengths
- Girth 5 graphs from relative difference sets
- Cayley cages
- Biregular cages of odd girth
- Net structure and cages
- Logarithmic girth expander graphs of \(SL_n({\mathbb{F}}_p)\)
- On biregular bipartite graphs of small excess
- General properties of some families of graphs defined by systems of equations
- Stage-graph representations
- On Erdős’s Proof of the Existence of Cages
- An introduction to the Ribe program
- On bipartite cages of excess 4
- Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth
- Symmetry properties of generalized graph truncations
- Improved lower bounds for the orders of even girth cages
This page was built for publication: Regular Graphs with Given Girth and Restricted Circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5727293)
