House of graphs 2.0: a database of interesting graphs and more
From MaRDI portal
Publication:2104929
Recommendations
Cites work
- A practical algorithm for the computation of the genus
- Facet defining inequalities among graph invariants: The system graphedron
- Fast generation of regular graphs and construction of cages
- Generation and properties of snarks
- GrInvIn in a nutshell
- House of Graphs: a database of interesting graphs
- How to Break MD5 and Other Hash Functions
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Positive-instance driven dynamic programming for treewidth
- Practical graph isomorphism. II.
Cited in
(52)- House of Graphs
- Colouring graphs with no induced six-vertex path or diamond
- Interpretable random forest model for identification of edge 3-uncolorable cubic graphs
- Some results on \(k\)-critical \(P_5\)-free graphs
- On decreasing the orders of (k,g)-graphs
- K2‐Hamiltonian graphs: II
- House of Graphs 2.0: a database of interesting graphs and more
- Generation and new infinite families of \(K_2\)-hypohamiltonian graphs
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
- Vertex and edge orbits in nut graphs
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
- Few Hamiltonian cycles in graphs with one or two vertex degrees
- Critical \((P_5,\mathit{dart})\)-free graphs
- Interactive 2D periodic graphs (media exposition)
- On graphs isomorphic with their conduction graph
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- Incorporating a database of graphs into a proof assistant
- Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study
- Lower bounds for book Ramsey numbers
- On vertex-girth-regular graphs: (non-)existence, bounds and enumeration
- Vertex-critical (P₅,W₄)-free graphs
- Theoretical and computational approaches to determining sets of orders for (k, g)-graphs
- On the construction of xor-magic graphs
- On the twin-width of near-regular graphs
- What is and is not inside a Cayley graph?
- Simplifying modular lattices by removing doubly irreducible elements
- On (k,g)-graphs without (g + 1)-cycles
- Graph harvester (software abstract)
- Tetravalent distance magic graphs of small order and an infinite family of examples
- Some results on critical (P₅, H)-free graphs
- A note on girth-diameter cages
- On cubic rainbow domination regular graphs
- Some results on critical (P₅,H)-free graphs
- On non-Hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs
- Uniquely Hamiltonian graphs for many sets of degrees
- Random eigenvalues of nanotubes
- Potential counter-examples to a conjecture on the column space of the adjacency matrix
- Topological scale framework for hypergraphs
- The Frank number and nowhere-zero flows on graphs
- Feynman symmetries of the Martin and c₂ invariants of regular graphs
- Nut graphs with a given automorphism group
- Small planar Hypohamiltonian graphs
- A graph called \textit{Harmony}
- The maximum number of connected sets in regular graphs
- Domination and packing in graphs
- Critical \(( P_5 , \mathrm{dart} )\)-free graphs
- Counterexamples to conjectures on the occupancy fraction of graphs
- Vertex-critical (P₅, W₄)-free graphs
- Minimal obstructions to C₅-Coloring in hereditary graph classes
- On the sum of the largest and smallest eigenvalue of odd-cycle free fraphs
- Minimal obstructions to C₅-coloring in hereditary graph classes
- Cubic graphs with edges in exactly one perfect matching
Describes a project that uses
Uses Software
This page was built for publication: House of graphs 2.0: a database of interesting graphs and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104929)
