Pages that link to "Item:Q1759891"
From MaRDI portal
The following pages link to House of Graphs: a database of interesting graphs (Q1759891):
Displaying 50 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)
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure (Q830874) (← 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)
- Snarks with special spanning trees (Q1733867) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles (Q2048366) (← links)
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\) (Q2057608) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
- Morphology of small snarks (Q2112562) (← links)
- On 2-factors splitting an embedded graph into two plane graphs (Q2121487) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- \(P_3\)-hull number of graphs with diameter two (Q2132359) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- On singular signed graphs with nullspace spanned by a full vector: signed nut graphs (Q2158206) (← links)
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers (Q2172420) (← links)
- A model for finding transition-minors (Q2192081) (← links)
- Perfect Italian domination on planar and regular graphs (Q2197486) (← links)
- DiscreteZOO: a fingerprint database of discrete objects (Q2209260) (← links)
- Critical and flow-critical snarks coincide (Q2227110) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- Existence of regular nut graphs for degree at most 11 (Q2296003) (← links)
- The smallest nontrivial snarks of oddness 4 (Q2306590) (← links)
- A note on the smallest connected non-traceable cubic bipartite planar graph (Q2319723) (← 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)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Unrooted non-binary tree-based phylogenetic networks (Q2656952) (← links)
- Non-Hamiltonian graphs in which every edge-contracted subgraph is Hamiltonian (Q2662552) (← links)
- On sensitivity in bipartite Cayley graphs (Q2668018) (← 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)
- The 6-girth-thickness of the complete graph (Q4956180) (← links)
- The 4-girth-thickness of the complete multipartite graph (Q5009944) (← links)
