House of Graphs
From MaRDI portal
swMATH6693MaRDI QIDQ18775FDOQ18775
Author name not available (Why is that?)
Official website: http://hog.grinvin.org/
Cited In (95)
- The 6-girth-thickness of the complete graph
- DiscreteZOO: a fingerprint database of discrete objects
- Secure sets and their expansion in cubic graphs
- \(k\)-critical graphs in \(P_5\)-free graphs
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
- Snarks with special spanning trees
- Morphology of small snarks
- Title not available (Why is that?)
- On essentially 4-edge-connected cubic bricks
- On prisms, Möbius ladders and the cycle space of dense graphs
- On sensitivity in bipartite Cayley graphs
- Unrooted non-binary tree-based phylogenetic networks
- Towards objective measures of algorithm performance across instance space
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Generation and properties of snarks
- The 4-girth-thickness of the complete multipartite graph
- On the smallest snarks with oddness 4 and connectivity 2
- Obstructions for three-coloring and list three-coloring \(H\)-free graphs
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Obstructions for three-coloring graphs without induced paths on six vertices
- Planar Hypohamiltonian Graphs on 40 Vertices
- \(P_3\)-hull number of graphs with diameter two
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- A faster test for 4-flow-criticality in snarks
- FuiGui
- GrInvIn
- Colt
- GVF
- Switching 3-edge-colorings of cubic graphs
- Traces
- plantri
- ComputeTW
- FindStat
- Mathchem
- Fullerene
- GraphTheory
- PostgreSQL
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
- GAUSS
- NodeTrix
- ToTo
- Buckygen
- CaGe
- GWT
- CoCalc
- GraPHedron
- DiscreteZOO
- GENREG
- CriticalPfreeGraphs
- GenerateUHG
- geng
- GenHypohamiltonian
- Small Graph Database
- snarkhunter
- Triangleramsey
- LibTW
- Cytoscape.js
- Exploring the role of graph spectra in graph coloring algorithm performance
- cuboids-code
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
- Computational results and new bounds for the circular flow number of snarks
- XZ Utils
- Title not available (Why is that?)
- BlueJ
- Graph6Java
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Integer sequence discovery from small graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Fullerenes with distant pentagons
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- Recursive generation of IPR fullerenes
- A practical algorithm for the computation of the genus
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Critical and flow-critical snarks coincide
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10
- The minimality of the Georges-Kelmans graph
- A note on the smallest connected non-traceable cubic bipartite planar graph
- McSparse
- On 12-regular nut graphs
- On 2-factors splitting an embedded graph into two plane graphs
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- Graphs with few Hamiltonian cycles
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- Perfect Italian domination on planar and regular graphs
- Existence of regular nut graphs for degree at most 11
- The smallest nontrivial snarks of oddness 4
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- Sizes of pentagonal clusters in fullerenes
- On bounding the difference between the maximum degree and the chromatic number by a constant
- A model for finding transition-minors
This page was built for software: House of Graphs
