House of Graphs
From MaRDI portal
Software:18775
swMATH6693MaRDI QIDQ18775FDOQ18775
Author name not available (Why is that?)
Cited In (60)
- A note on the smallest connected non-traceable cubic bipartite planar graph
- The 6-girth-thickness of the complete graph
- DiscreteZOO: a fingerprint database of discrete objects
- Secure sets and their expansion in cubic graphs
- \(k\)-critical graphs in \(P_5\)-free graphs
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
- Spectral clustering of combinatorial fullerene isomers based on their facet graph structure
- On 12-regular nut graphs
- Snarks with special spanning trees
- Morphology of small snarks
- Title not available (Why is that?)
- On essentially 4-edge-connected cubic bricks
- On prisms, Möbius ladders and the cycle space of dense graphs
- On sensitivity in bipartite Cayley graphs
- Unrooted non-binary tree-based phylogenetic networks
- Towards objective measures of algorithm performance across instance space
- On 2-factors splitting an embedded graph into two plane graphs
- Construction of fullerenes and Pogorelov polytopes with 5-, 6- and one 7-gonal face
- Generation and properties of snarks
- The 4-girth-thickness of the complete multipartite graph
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs
- On the smallest snarks with oddness 4 and connectivity 2
- Colouring graphs with no induced six-vertex path or diamond
- Colouring graphs with no induced six-vertex path or diamond
- Obstructions for three-coloring graphs without induced paths on six vertices
- Planar Hypohamiltonian Graphs on 40 Vertices
- \(P_3\)-hull number of graphs with diameter two
- The Ramsey number \(R(3,K_{10}-e)\) and computational bounds for \(R(3,G)\)
- A faster test for 4-flow-criticality in snarks
- Switching 3-edge-colorings of cubic graphs
- Perfect Italian domination on planar and regular graphs
- 4-connected polyhedra have at least a linear number of Hamiltonian cycles
- The minimality of the Georges–Kelmans graph
- Existence of regular nut graphs for degree at most 11
- Exploring the role of graph spectra in graph coloring algorithm performance
- A counterexample to the pseudo 2-factor isomorphic graph conjecture
- Computational results and new bounds for the circular flow number of snarks
- Title not available (Why is that?)
- The smallest nontrivial snarks of oddness 4
- \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers
- New bounds for Ramsey numbers \(R ( K_k - e , K_l - e )\)
- Exhaustive Generation of k-Critical $${\mathcal H}$$ -Free Graphs
- Integer sequence discovery from small graphs
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Sizes of pentagonal clusters in fullerenes
- On bounding the difference between the maximum degree and the chromatic number by a constant
- Fullerenes with distant pentagons
- On the strongest form of a theorem of Whitney for Hamiltonian cycles in plane triangulations
- New computational upper bounds for Ramsey numbers \(R(3,k)\)
- Recursive generation of IPR fullerenes
- A model for finding transition-minors
- Cycle‐Continuous Mappings—Order Structure
- A practical algorithm for the computation of the genus
- Constructions of families of three-dimensional polytopes, characteristic patches of fullerenes, and Pogorelov polytopes
- \textsc{ToTo}: an open database for computation, storage and retrieval of tree decompositions
- Critical and flow-critical snarks coincide
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs
- Graphs with few hamiltonian cycles
- Ramsey numbers \(R(K_3, G)\) for graphs of order 10
This page was built for software: House of Graphs