GENREG

swMATH26671MaRDI QIDQ38400FDOQ38400

Author name not available (Why is that?)

Cited In (64)

• Verification of the Jones unknot conjecture up to 22 crossings
• $4$-Regular prime graphs of nonsolvable groups
• Title not available (Why is that?)
• Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\)
• CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION
• An alternate description of a (q + 1, 8)-cage
• The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
• On self-clique shoal graphs
• A construction of small \((q-1)\)-regular graphs of girth 8
• Approximately strongly regular graphs
• Refined MDP-based branch-and-fix algorithm for the Hamiltonian cycle problem
• Chromatic-index-critical graphs of orders 13 and 14
• New realizations of modular forms in Calabi-Yau threefolds arising from \(\phi^{4}\) theory
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• On 2-factors splitting an embedded graph into two plane graphs
• Optimal regular graph designs
• Computation of best possible low degree expanders
• Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
• On the complexity and algorithm of grooming regular traffic in WDM optical networks
• The construction of cubic and quartic planar maps with prescribed face degrees
• Drawing Cubic Graphs with the Four Basic Slopes
• New small regular graphs of girth 5
• Computing the maximal canonical form for trees in polynomial time
• A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist
• A Linear-size Conversion of HCP to 3HCP
• Topological configurations \((n_4)\) exist for all \(n\geq 17\)
• Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\)
• Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs
• ``Immunetworks, intersecting circuits and dynamics
• Families of small regular graphs of girth 5
• Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages
• On the Minimum Number of Hamiltonian Cycles in Regular Graphs
• Improved bounds for hypohamiltonian graphs
• There are no cubic graphs on 26 vertices with crossing number 10 or 11
• Spectra of orders for \(k\)-regular graphs of girth \(g\)
• Perfect Italian domination on planar and regular graphs
• The minimality of the Georges–Kelmans graph
• Existence of regular nut graphs for degree at most 11
• A counterexample to the pseudo 2-factor isomorphic graph conjecture
• On bipartite graphs of defect at most 4
• The face pair of planar graphs
• On upper bounds of odd girth cages
• The Generation of Fullerenes
• A new heuristic for detecting non-Hamiltonicity in cubic graphs
• Vertex-magic labelings of regular graphs. II.
• Fast generation of regular graphs and construction of cages
• Integer sequence discovery from small graphs
• Girth 5 graphs from relative difference sets
• Girth 5 graphs from elliptic semiplanes
• Regular graphs with girth at least 5 and small second largest eigenvalue
• Computing the list chromatic index of graphs
• Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players
• Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian
• Correlation between graphs with an application to brain network analysis
• The 10-cages and derived configurations
• On even cycle decompositions of 4-regular line graphs
• Constructions of small regular bipartite graphs of girth 6
• Clustering of spectra and fractals of regular graphs
• Oriented cliques and colorings of graphs with low maximum degree
• House of graphs 2.0: a database of interesting graphs and more
• Graphs with few hamiltonian cycles
• Isotropic matroids. III: Connectivity
• Title not available (Why is that?)

This page was built for software: GENREG