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
(18)- Determining chromatic index of cubic graph with the use of explainable classifiers: a comparative study
- Few Hamiltonian cycles in graphs with one or two vertex degrees
- Interactive 2D periodic graphs (media exposition)
- On decreasing the orders of \((k,g)\)-graphs
- Critical \((P_5,\mathit{dart})\)-free graphs
- Improved asymptotic upper bounds for the minimum number of longest cycles in regular graphs
- Incorporating a database of graphs into a proof assistant
- House of Graphs 2.0: a database of interesting graphs and more
- House of Graphs
- Colouring graphs with no induced six-vertex path or diamond
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs
- Generation and new infinite families of \(K_2\)-hypohamiltonian graphs
- K2‐Hamiltonian graphs: II
- Attainable bounds for algebraic connectivity and maximally connected regular graphs
- Some results on \(k\)-critical \(P_5\)-free graphs
- On graphs isomorphic with their conduction graph
- Interpretable random forest model for identification of edge 3-uncolorable cubic graphs
- Vertex and edge orbits in nut graphs
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)
