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