Pages that link to "Item:Q1759891"
From MaRDI portal
The following pages link to House of Graphs: a database of interesting graphs (Q1759891):
Displayed 22 items.
- House of Graphs (Q18775) (← links)
- A faster test for 4-flow-criticality in snarks (Q324779) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\) (Q396940) (← links)
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Generation and properties of snarks (Q463288) (← links)
- Recursive generation of IPR fullerenes (Q498482) (← links)
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions (Q516870) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face (Q1657010) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- A counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2354717) (← links)
- Sizes of pentagonal clusters in fullerenes (Q2402936) (← links)
- On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810) (← links)
- On prisms, Möbius ladders and the cycle space of dense graphs (Q2441654) (← links)
- On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (Q2825481) (← links)
- Planar Hypohamiltonian Graphs on 40 Vertices (Q2958202) (← links)
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes (Q3130360) (← links)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs (Q3181051) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- Cycle‐Continuous Mappings—Order Structure (Q5272633) (← links)