Pages that link to "Item:Q5725269"
From MaRDI portal
The following pages link to Regular graphs with given girth and minimal number of knots. (Q5725269):
Displaying 50 items.
- Cayley cages (Q356724) (← links)
- On bi-regular cages of even girth at least 8 (Q387618) (← links)
- On the order of graphs with a given girth pair (Q394547) (← links)
- On regular hypergraphs of high girth (Q405152) (← links)
- Low-distortion embeddings of graphs with large girth (Q413201) (← links)
- Recursive constructions of small regular graphs of given degree and girth (Q442380) (← links)
- Families of small regular graphs of girth 5 (Q449121) (← links)
- Regular graphs of large girth and arbitrary degree (Q485001) (← links)
- On the density of triangles and squares in regular finite and unimodular random graphs (Q485502) (← links)
- New family of small regular graphs of girth 5 (Q510562) (← links)
- On bipartite cages of excess 4 (Q521356) (← links)
- New improvements on connectivity of cages (Q546369) (← links)
- Decoding turbo-like codes via linear programming (Q598251) (← links)
- Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs (Q653831) (← links)
- Monotonicity of the order of \((D;g)\)-cages (Q654223) (← links)
- Growth of the Weil-Petersson diameter of moduli space (Q662421) (← links)
- On the girth of infinite graphs (Q685556) (← links)
- On the limitations of the use of solvable groups in Cayley graph cage constructions (Q709252) (← links)
- A new bound for the connectivity of cages (Q712582) (← links)
- On regular induced subgraphs of generalized polygons (Q721048) (← links)
- Improved lower bounds for the orders of even girth cages (Q727055) (← links)
- Explicit construction of regular graphs without small cycles (Q790830) (← links)
- Girth in graphs (Q792338) (← links)
- Comparison of mean distance in superposed networks (Q793635) (← links)
- Relaxed two-coloring of cubic graphs (Q885301) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Small bi-regular graphs of even girth (Q898123) (← links)
- Applications of integer programming methods to cages (Q907225) (← links)
- On the connectivity of \((k,g)\)-cages of even girth (Q932601) (← links)
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey (Q932603) (← links)
- Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages (Q965992) (← links)
- On upper bounds of odd girth cages (Q968440) (← links)
- On the girth of extremal graphs without shortest cycles (Q998448) (← links)
- On the homogeneous algebraic graphs of large girth and their applications (Q1006033) (← links)
- Constructions of bi-regular cages (Q1024448) (← links)
- On the number of components of \((k,g)\)-cages after vertex deletion (Q1026135) (← links)
- Girths of bipartite sextet graphs (Q1058529) (← links)
- Graphs with prescribed degree sets and girth (Q1147160) (← links)
- Explicit constructions of graphs without short cycles and low density codes (Q1167742) (← links)
- On sparse spanners of weighted graphs (Q1196368) (← links)
- Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs (Q1210558) (← links)
- Un problème extremal pour les graphes et les hypergraphes (Q1216326) (← links)
- Forest embeddings in regular graphs of large girth (Q1252244) (← links)
- Net structure and cages (Q1257902) (← links)
- The number of cycle lengths in graphs of given minimum degree and girth (Q1301632) (← links)
- On the jumping constant conjecture for multigraphs (Q1345881) (← links)
- A simple construction of high representativity triangulations (Q1367040) (← links)
- Partitioning into graphs with only small components (Q1405114) (← links)
- Generating \(r\)-regular graphs (Q1406030) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
