House of Graphs: A database of interesting graphs-Reference-Cited by-同舟云学术

House of Graphs: A database of interesting graphs

Published:2013-01 Issue:1-2 Volume:161 Page:311-314
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Brinkmann Gunnar,Coolsaet Kris,Goedgebeur Jan,Mélot Hadrien

Funder

Research Foundation of Flanders (FWO)

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference12 articles.

1. All Ramsey numbers r(K3,G) for connected graphs of order 9;Brandt;Electronic Journal of Combinatorics,1998

2. The generation of maximal triangle-free graphs;Brandt;Graphs and Combinatorics,2000

3. Fast generation of cubic graphs;Brinkmann;Journal of Graph Theory,1996

4. Generation of cubic graphs;Brinkmann;Discrete Mathematics and Theoretical Computer Science,2011

5. G. Li, F. Ruskey, The advantages of forward thinking in generating rooted and free trees, in: 10th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 1999, pp. 939–940.

Cited by 103 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On different versions of the exact subgraph hierarchy for the stable set problem;Discrete Applied Mathematics;2024-10

2. Lockstep-Parallel Dualization of Surface Triangulations;Proceedings of the Platform for Advanced Scientific Computing Conference;2024-06-03

3. Quantum walks as thermalisations, with application to fullerene graphs;Physica A: Statistical Mechanics and its Applications;2024-06

4. Vertex and Edge Orbits in Nut Graphs;The Electronic Journal of Combinatorics;2024-05-31

5. Cubic Graphs with Colouring Defect 3;The Electronic Journal of Combinatorics;2024-04-05