House of Graphs - MaRDI portal

Cited in

(97)

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

This page was built for software: House of Graphs