The following pages link to Practical graph isomorphism. II. (Q2437295):
Displaying 50 items.
- Automorphism groups of some families of bipartite graphs (Q4958046) (← links)
- (Q4969154) (← links)
- Small minimal $(3, 3)$-Ramsey graphs (Q4994194) (← links)
- Lower bounding the Folkman numbers $F_v(a_1, ..., a_s; m - 1)$ (Q4994199) (← links)
- Computing modular data for pointed fusion categories (Q4994370) (← links)
- Spectrally Robust Graph Isomorphism (Q5002763) (← links)
- Graph Similarity and Approximate Isomorphism (Q5005120) (← links)
- A graph theoretical analysis of the number of edges in k-dense graphs (Q5006573) (← links)
- Relating centralities in graphs and the principal eigenvector of its distance matrix (Q5027710) (← links)
- The Power of the Weisfeiler--Leman Algorithm to Decompose Graphs (Q5028356) (← links)
- (Q5038380) (← links)
- Towards Efficient Normalizers of Primitive Groups (Q5039561) (← links)
- Isomorphism and Invariants of Parallelisms of Projective Spaces (Q5039568) (← links)
- Algebraic Polytopes in Normaliz (Q5039571) (← links)
- Nonexistence Certificates for Ovals in a Projective Plane of Order Ten (Q5041183) (← links)
- Lights Out On A Random Graph (Q5045960) (← links)
- The complement problem for linklessly embeddable graphs (Q5050621) (← links)
- Trinajstić Index (Q5051405) (← links)
- Computation of new diagonal graph Ramsey numbers (Q5054055) (← links)
- Eternal domination and clique covering (Q5054057) (← links)
- The minimality of the Georges–Kelmans graph (Q5070550) (← links)
- CONICS IN SEXTIC -SURFACES IN (Q5078584) (← links)
- Constructions of cospectral graphs with different zero forcing numbers (Q5078599) (← links)
- (Q5090449) (← links)
- Reconstruction of small graphs and digraphs (Q5090542) (← links)
- (Q5091279) (← links)
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs (Q5092407) (← links)
- The Optimal Packing of Eight Points in the Real Projective Plane (Q5094481) (← links)
- Symmetry-driven network reconstruction through pseudobalanced coloring optimization (Q5101076) (← links)
- Benchmark Graphs for Practical Graph Isomorphism (Q5111749) (← links)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- On L-shaped point set embeddings of trees: first non-embeddable examples (Q5119383) (← links)
- Construction of All Minimal Edge Extensions of the Graph with Isomorphism Rejection (Q5122697) (← links)
- A class of Ramsey-extremal hypergraphs (Q5134529) (← links)
- Edge crossings in random linear arrangements (Q5135062) (← links)
- (Q5139693) (← links)
- Isomorphism Test for Digraphs with Weighted Edges. (Q5140741) (← links)
- COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH (Q5151276) (← links)
- CONSTRUCTING ALL NONISOMORPHIC SUPERGRAPHS WITH ISOMORPHISM REJECTION (Q5151447) (← links)
- Finding the Hardest Formulas for Resolution (Q5154766) (← links)
- Independence Equivalence Classes of Paths and Cycles (Q5206913) (← links)
- Graphs with few hamiltonian cycles (Q5207451) (← links)
- Construction of All Nonisomorphic Minimal Vertex Extensions of the Graph by the Method of Canonical Representatives (Q5218295) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- A Generic Framework for Engineering Graph Canonization Algorithms (Q5232733) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- Short certificates for chromatic equivalence (Q5377353) (← links)
- Constructing Hard Examples for Graph Isomorphism (Q5377355) (← links)
- Network Analysis (Q5703973) (← links)
- Classification of Graeco-Latin Cubes (Q5744161) (← links)
