GENREG
From MaRDI portal
Software:38400
No author found.
Related Items (64)
On self-clique shoal graphs ⋮ On 2-factors splitting an embedded graph into two plane graphs ⋮ Isotropic matroids. III: Connectivity ⋮ Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs ⋮ Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem ⋮ Unnamed Item ⋮ Computing the maximal canonical form for trees in polynomial time ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ The minimality of the Georges–Kelmans graph ⋮ A new heuristic for detecting non-Hamiltonicity in cubic graphs ⋮ New small regular graphs of girth 5 ⋮ 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 even cycle decompositions of 4-regular line graphs ⋮ Unnamed Item ⋮ New realizations of modular forms in Calabi-Yau threefolds arising from \(\phi^{4}\) theory ⋮ Clustering of spectra and fractals of regular graphs ⋮ Drawing Cubic Graphs with the Four Basic Slopes ⋮ Perfect Italian domination on planar and regular graphs ⋮ Improved bounds for hypohamiltonian graphs ⋮ Optimal regular graph designs ⋮ Integer sequence discovery from small graphs ⋮ On the complexity and algorithm of grooming regular traffic in WDM optical networks ⋮ Some graphs whose second largest eigenvalue does not exceed \(\sqrt 2\) ⋮ Computing the list chromatic index of graphs ⋮ Families of small regular graphs of girth 5 ⋮ The 10-cages and derived configurations ⋮ Evolution of cooperation for multiple mutant configurations on all regular graphs with \(N \leq 14\) players ⋮ Verification of the Jones unknot conjecture up to 22 crossings ⋮ Computation of best possible low degree expanders ⋮ CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION ⋮ Unnamed Item ⋮ On the Minimum Number of Hamiltonian Cycles in Regular Graphs ⋮ Finding small regular graphs of girths 6, 8 and 12 as subgraphs of cages ⋮ On upper bounds of odd girth cages ⋮ Fast generation of regular graphs and construction of cages ⋮ A distance regular graph with intersection array \((21,16,8;1,4,14)\) does not exist ⋮ $4$-Regular prime graphs of nonsolvable groups ⋮ Girth 5 graphs from relative difference sets ⋮ The face pair of planar graphs ⋮ ``Immunetworks, intersecting circuits and dynamics ⋮ An alternate description of a (q + 1, 8)-cage ⋮ Spectral analysis of transient amplifiers for death-birth updating constructed from regular graphs ⋮ Correlation between graphs with an application to brain network analysis ⋮ Graphs with few hamiltonian cycles ⋮ There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14 ⋮ Spectra of orders for \(k\)-regular graphs of girth \(g\) ⋮ Existence of regular nut graphs for degree at most 11 ⋮ Constructions of small regular bipartite graphs of girth 6 ⋮ The construction of cubic and quartic planar maps with prescribed face degrees ⋮ The Generation of Fullerenes ⋮ Oriented cliques and colorings of graphs with low maximum degree ⋮ On bipartite graphs of defect at most 4 ⋮ A Linear-size Conversion of HCP to 3HCP ⋮ Topological configurations \((n_4)\) exist for all \(n\geq 17\) ⋮ Vertex-magic labelings of regular graphs. II. ⋮ Chromatic-index-critical graphs of orders 13 and 14 ⋮ A construction of small \((q-1)\)-regular graphs of girth 8 ⋮ Excellent graphs with respect to domination: subgraphs induced by minimum dominating sets ⋮ 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 ⋮ A counterexample to the pseudo 2-factor isomorphic graph conjecture
This page was built for software: GENREG
