House of Graphs - MaRDI portal

Cited in

(97)

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

This page was built for software: House of Graphs