Fast generation of regular graphs and construction of cages
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Topological configurations (n₄) exist for all n 17
- Vertex-magic labelings of regular graphs. II.
- Greedy construction of nearly regular graphs
- Correlation between graphs with an application to brain network analysis
- The 10-cages and derived configurations
- New realizations of modular forms in Calabi-Yau threefolds arising from \(\phi^{4}\) theory
- Optimal regular graph designs
- Computing the list chromatic index of graphs
- A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
- Girth 5 graphs from relative difference sets
- ``Immunetworks, intersecting circuits and dynamics
- The construction of cubic and quartic planar maps with prescribed face degrees
- A note on Brill-Noether existence for graphs of low genus
- Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs
- Spectra of orders for \(k\)-regular graphs of girth \(g\)
- House of graphs 2.0: a database of interesting graphs and more
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
- Approximately strongly regular graphs
- On 2-factors splitting an embedded graph into two plane graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Perfect Italian domination on planar and regular graphs
- Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players
- Existence of regular nut graphs for degree at most 11
- Oriented cliques and colorings of graphs with low maximum degree
- A construction of small \((q-1)\)-regular graphs of girth 8
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
- Isotropic matroids. III: Connectivity
- New small regular graphs of girth 5
- Computation of best possible low degree expanders
- The face pair of planar graphs
- Small regular graphs of girth 7
- Chromatic-index-critical graphs of orders 13 and 14
- Computing the maximal canonical form for trees in polynomial time
- Regular graphs with girth at least 5 and small second largest eigenvalue
- There are no cubic graphs on 26 vertices with crossing number 10 or 11
- Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
- On self-clique shoal graphs
- Fast generation of some classes of planar graphs
- Generating incidence structures with given girth
- Constructions of small regular bipartite graphs of girth 6
- Drawing Cubic Graphs with the Four Basic Slopes
- A new heuristic for detecting non-Hamiltonicity in cubic graphs
- scientific article; zbMATH DE number 4148119 (Why is no real title available?)
- Recursive Generation of 5-Regular Planar Graphs
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- scientific article; zbMATH DE number 3989381 (Why is no real title available?)
- On even cycle decompositions of 4-regular line graphs
- Stability analysis for the group dynamics consensus with time delayed communications
- scientific article; zbMATH DE number 1303556 (Why is no real title available?)
- scientific article; zbMATH DE number 733794 (Why is no real title available?)
- Recursive constructions of small regular graphs of given degree and girth
- Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
- Families of small regular graphs of girth 5
- Improved bounds for hypo-Hamiltonian graphs
- Moments of the inverse participation ratio for the Laplacian on finite regular graphs
- Verification of the Jones unknot conjecture up to 22 crossings
- On the minimum number of Hamiltonian cycles in regular graphs
- Fast generation of cubic graphs
- The minimality of the Georges-Kelmans graph
- 4-regular prime graphs of nonsolvable groups
- Constructing all nonisomorphic supergraphs with isomorphism rejection
- Efficient generation of all regular non-dominated coteries
- An alternate description of a \((q + 1, 8)\)-cage
- Graphs with few Hamiltonian cycles
- Hybrid evolutionary algorithm for the b-chromatic number
- Generation of cubic graphs
- On Hadamard diagonalizable graphs
- Locally recoverable codes from planar graphs
- Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
- Breaking symmetries with high dimensional graph invariants and their combination
- Enumerating Steiner triple systems
- Regular graphs with a complete bipartite graph as a star complement
- Statistics of Feynman amplitudes in \(\phi^4\)-theory
- Signed Ramsey numbers
- Steiner triple systems of order 21 with subsystems
- Spectral dynamics of guided edge removals and identifying transient amplifiers for death-birth updating
- Radius \(r\) extremal graphs of girth 5
- Few Hamiltonian cycles in graphs with one or two vertex degrees
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- Regular graphs with positive Ollivier-Ricci curvature
- Maximizing the number of integer pairs summing to powers of 2 via graph labeling and solving restricted systems of linear (in)equations
- On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
- Spectral polynomials, graph descriptors, spectra, and entropies of cage graphs
- Theoretical and computational approaches to determining sets of orders for (k, g)-graphs
- On the twin-width of near-regular graphs
- An approach to the girth problem in cubic graphs
- A construction for regular-graph designs
- On (k,g)-graphs without (g + 1)-cycles
- Tetravalent distance magic graphs of small order and an infinite family of examples
- About the maximum number of vertices in primitive regular graphs with exponent equals 3
- The maximum number of connected sets in regular graphs
- Design spectra for 6-regular graphs with 12 vertices
- Counterexamples to conjectures on the occupancy fraction of graphs
- Isotropic matroids. II: Circle graphs
- The net-regular strongly regular signed graphs with degree 6
- The Gray graph is pseudo 2-factor isomorphic
- Generating maps on oriented surfaces using the homomorphism principle
- On the toughness of regular graphs and prisms
- On bipartite graphs of defect at most 4
This page was built for publication: Fast generation of regular graphs and construction of cages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229267)
